#include <iostream>
#include <vector>
#include <algorithm>
// #include <bits/stdc++.h>
using namespace std;

int main() {
	int l,n;
	cin >> l >> n;

	vector<int> w(n);
	int sum=0, count=0;

	for (int i = 0; i < n; i++) {
		cin >> w.at(i);
	}

	sort(w.begin(),w.end());

	for (int i = 0; i < n; i++) {
		if (sum + w.at(i) <= l) {
			sum += w.at(i);
			count++;
		}
		else
			break;
	}


	cout << count << endl;


	return 0;
}