#include <bits/stdc++.h>
using namespace std;

int main(int argc, char const* argv[])
{
	int L,N;
	cin>>L>>N;
	vector<int> W(N);
	for (int i = 0; i < N; i++) {
		cin>>W[i];
	}
	int l,counter;
	counter = 0;
	sort(W.begin(), W.end());
	l = 0;
	for (int i = 0; i < N; i++) {
		l += W[i];
		if(l <= L){
			counter++;
		}
		else{
		break;
		}
	}
	cout<<counter<<endl;
	return 0;
}