#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int L, N;
int W[100010];

int main()
{
	cin >> L >> N;
	for (int i = 0; i < N; i++)
		cin >> W[i];
	sort(W,W+N);

	ll sum = 0;
	int i = 0; 
	while (i < N) {
		sum += W[i];
		if (sum > L)break;
		i++;
	}
	cout << i << endl;
	return 0;
}