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

	int cnt = 0;
	for (int i = 0; i < N; i++) {
		if (L < W[i]) break;
		
		cnt += 1;
		L -= W[i];
	}

	cout << cnt << endl;

	return 0;
}