#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
	int wid, num;
	int temp_w;
	int sum = 0;
	vector<int> w;
	cin >> wid >> num;
	for (int i = 0; i < num; i++) {
		cin >> temp_w;
		w.push_back(temp_w);
	}

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

	for (int i = 0; i < num; i++) {
		if ((sum += w[i]) > wid) {
			cout << i << endl;
			return 0;
		}
	}

	cout << num << endl;

	return 0;
}