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

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

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

	w.emplace_back(l);
	int ans = 0;
	for (int i = 0; i <= n; i++) {
		l -= w[i];
		ans++;
		if (l < 0) {
			break;
		}
	}
	cout << ans - 1 << endl;

	return 0;
}