#include <iostream>
#include <vector>
#include <algorithm>
//#include <string>
//#include <iomanip>

using namespace std;

int main()
{
	int L, N;
	cin >> L >> N;
	vector<int> W(N);
	for (int i = 0; i < N; i++)
		cin >> W.at(i);

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

	int WSum = 0;
	int cnt = 0;
	while (cnt < N && WSum + W.at(cnt) <= L)
	{
		WSum += W.at(cnt);
		cnt++;
	}

	cout << cnt << endl;

	return 0;
}