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

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

	int sum=0;
	for (int i = 0; i < n; i++) {
		sum += w[i];
		if (sum > l) {
			cout << i << endl;
			return 0;
		}
	}
	cout << n << endl;

	return 0;
}