#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
	int l,n;
	cin >> l;
	cin >> n;

	int w[n];
	REP(i,n) cin >> w[i];
	sort(w,w+n);


	int cnt = 0;
	while(l >= 0 && cnt < n){

		l = l - w[cnt];
		cnt += 1;

	}
	if(cnt != n) cnt = cnt-1;
	cout << cnt << endl;
	return 0;
}