#include <bits/stdc++.h>
using namespace std;

int main()
{
	int l, n;
	cin >> l >> n;
	int a;
	priority_queue<int, vector<int>, greater<int>> pq;
	for(int i = 0; i < n; i++)
	{
		cin >> a;
		pq.push(a);
	}
	
	int ans = 0;
	while(!pq.empty())
	{
		int p = pq.top();
		pq.pop();
		if(l < p) break;
		l -= p;
		ans++;
	}
	cout << ans << endl;
	return 0;
}