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

using namespace std;

int main(int argc, char** argv)
{
	int l, n;
	cin >> l >> n;
	vector<int> wv;
	for (int ii=0; ii<n; ++ii) {
		int w; cin >> w;
		wv.push_back(w);
	}
	sort(wv.begin(), wv.end());

	int ii=0;
	for (; ii<wv.size(); ++ii) {
		l -= wv[ii];
		if (l <= 0) {
			cout << ii+(l==0?1:0) << endl;
			return 0;
		}
	}
	cout << ii << endl;
	return 0;
}