#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

int main()
{
	int L, N, W[ 10001 ];

	while( cin >> L ){
		memset( W, 0, sizeof(W) );
		cin >> N;
		for( int i = 0; i < N; ++i ){
			cin >> W[ i ];
		}
		W[ N ] = L + 1;
		sort( W, W + N );
		int S = 0;
		for( int i = 0; i < N + 1; ++i ){
			S += W[ i ];
			if( S > L ){
				cout << i << endl;
				break;
			}
		}
	}

	return 0;
}