#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long int lont;
int main() {
	int L, N;
	cin >> L >> N;
	vector<int>vec(N);
	for (int ia = 0; ia < N; ia++) {
		cin >> vec.at(ia);
	}
	int cnt = 0;
	sort(vec.begin(), vec.end());
	for (int ib = 0; ib < N; ib++) {
		if (L - vec.at(ib) >= 0) {
			cnt++;
			L = L - vec.at(ib);
		}
		else {
			break;
		}
	}
	cout << cnt << endl;
}