#include<iostream>
#include<algorithm>

using namespace std;

#define NMAX 10000

int main(){

	int L,N,W[NMAX];

	cin>>L;
	cin>>N;
	for(int i=0;i<N;i++){
		cin>>W[i];
	}

	sort(W,W+N);

	int k;
	for(k=0;k<N;k++){
		if(L-W[k]<0) break;
		L-=W[k];
	}

	cout<<k<<endl;
}