#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
	int L;
	int N;
	cin>>L;
	cin>>N;
	int i;
	vector<int> W(N);
	for (i=0;i<N;i++){
		cin>>W[i];
	}
	sort(W.begin(),W.end());
	int S=0;
	int ans=0;
	for (i=0;i<N;i++){
		S+=W[i];
		if (S<=L){
			ans++;
		}
	}
	cout<<ans<<endl;
	return 0;
}