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

using namespace std;

int main()
{
	int L; cin >> L;
	int N; cin >> N;
	vector<int> Wi;
	
	for (int i = 0; i < N; i++)
	{
		int w; cin >> w;
		Wi.push_back(w);
	}
	
	sort(Wi.begin(), Wi.end());
	
	vector<int>::iterator it = Wi.begin();
	int cnt = 0;
	while (it != Wi.end() && L - *it >= 0)
	{
		L -= *it;
		cnt++;
		it++;
	}
	
	cout << cnt << endl;
	
	return 0;
}