#include<iostream>
#include<algorithm>
using namespace std;

int main() {
	int L,N;
	int W[10000];
	cin >> L;
	cin >> N;
	for (int i = 0;i <= N-1;i++) {
		cin >> W[i];
	}
	sort(W, W + N);
	int l = 0;	
	int j = 0;	//count
	while (j != N) {
		 l = l + W[j];
		if (l > L) {
			cout << j << endl;
			break;
		}else if (l == L) {
			cout << j + 1 << endl;
			break;
		}
		j++;
	}
	if (j == N) {
		cout << j << endl;
	}
	
	return 0;
}