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

int main() {
	int L; cin >> L;
	int N; cin >> N;
	vector<int> a(N);
	for (int i = 0; i < N; i++) cin >> a[i];
	sort(a.begin(), a.end());
	int ans = 0;
	for (int i = 0; i < N; i++) {
		if (L >= a[i]) {
			L -= a[i];
			ans++;
		}
	}
	cout << ans << endl;
}