#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int main() {

	int s,L, N, ii = 0,count=0;
	cin >> L >> N;
	
	vector<int> W(N);
	
	for (int i = 0; i < N; i++) cin >> W[i];
	
	sort(W.begin(), W.end());
	
	for (int i = 0; i < N; i++) {
		L -= W[i];
		if (L >= 0) count++;
		else break;
	}
	cout << count << endl;
	return 0;
}