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

int main(){
int L,N,ans;
	cin>>L>>N;
	vector<int> W(N);
	for(int i=0;i<N;i++)
	{
		cin>>W[i];
	}
	
	sort(W.begin(),W.end());
	int tmp=W[0];
	for(ans=1;tmp<L;ans++)
	{
		tmp+=W[ans];
	}
	
	if(ans==1||tmp==L)
	cout<<ans<<endl;
	else
	cout<<ans-1<<endl;
	return 0;
	}