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

int main() {
	int l, n;
	std::vector<int> w;
	std::cin >> l;
	std::cin >> n;
	for (int i = 0; i < n; ++i) {
		int tmp;
		std::cin >> tmp;
		w.push_back(tmp);
	}
	std::sort(w.begin(), w.end());

	int count = 0, sum = 0;
	for (;;) {
		sum += w[count];
		if (count >= n || sum > l) { break; }
		++count;
	}
	std::cout << count << "\n";
}