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

int main(void) {
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	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] >= 0) {
			L -= W[i];
			++cnt;
		}
	}
	cout << cnt;
	return 0;
}