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

int main(){
	int l,n;
	cin >> l >> n;
	vector<int> w(n);
	for(int i=0;i<n;i++) cin >> w.at(i);
	
	sort(w.begin(),w.end());
	
	int count = 0;
	int wide = 0;
	for(int i=0;i<n;i++){
		wide += w.at(i);
		if(wide > l) break;
		
		count++;
	}
	
	cout << count << endl;
	return 0;
}