#include <iostream>		//cin, cout
#include <vector>		//vector
#include <algorithm>	//sort,min,max,count

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());

	int ans = 0, now = 0;
	while (1) {
		now += W[ans];
		if (now <= L) {
			ans++;
			if (ans >= N) {
				break;
			}
		}
		else {
			break;
		}
	}

	cout << ans << endl;

	return 0;

}