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

int main(int, char **)
{
	int l;
	size_t n;
	std::vector<int> w;
	std::cin >> l >> n;
	if (n > 10000) return -1;
	for (int i = 0, input = 0; i < n; ++i)
	{
		std::cin >> input;
		w.push_back(input);
	}

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

	int cnt = 0;
	for (int i = 0, s = 0; i < w.size() && (s += w[i]) <= l; ++i)
	{
		++cnt; 
	}

	std::cout << cnt << std::endl;

	return 0;
}