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


int l,n;
int w[10100];

int main(){
	cin>>l>>n;
	for(int i=0;i<n;i++){
		cin>>w[i];
	}
	sort(w,w+n);

	//for(int j=0;j<n;j++)cout<<"w["<<j<<"]="<<w[j]<<endl;
	
	int total =0;
	int ans=0;
	for(int i=0;i<n;i++){

		total+=w[i];

		if(total>l)break;
		
		ans++;
	}

	cout<<ans<<endl;
}