#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 100005;

int n, m;
int P[ N ];

int main( void ) {
	scanf( "%d%d", &n, &m );
	for( int i = 0; i < m; i++ ) scanf( "%d", P + i );
	sort( P, P + m );
	int sol = 0;
	int curr = 0;
	for( int i = 0; i < m; i++ ) {
		if( curr + P[ i ] > n ) break;
		curr += P[ i ];
		sol++;
	}
	printf( "%d\n", sol );
	return 0;
}