#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>

using namespace std;

int main()
{
	int l, n, count = 0;

	cin>>l>>n;

	vector<int> w;

	for(int i = 0; i<n; i++) {
		int x;
		cin>>x;
		w.push_back(x);
	}

	sort(w.begin(), w.end());

	for(int j = 0; j<n; j++) {
		if(l>=w[j]) {
			l = l - w[j];
			count++;
		}
	}

	cout<<count<<endl;

	return 0;
}