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

using namespace std;

int main(void)
{
	int L, N;
	cin >> L;
	cin >> N;
	int t;
	vector<int> vw;
	for(int i = 0; i < N; i++)
	{
		cin >> t;
		if(vw.size() == 0)
			vw.push_back(t);
		else
		{
			vector<int>::iterator it = lower_bound(vw.begin(), vw.end(), t);
			vw.insert(it, t);
		}
	}

	int sum = 0;
	int count = 0;
	vector<int>::iterator it = vw.begin();
	while(1)
	{
		sum += *it;
		if (sum > L || it == vw.end())
			break;
		else
		{
			it++;
			count++;
		}
	}

	cout << count << endl;

	return 0;
}