#include"bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,m,n) for(ll i=(ll)m;i<(ll)n;i++)
#define Endl endl
#define pr(i,j) make_pair(i,j) 
const ll mod = 998244353;
const ll inf = 5e18;
const ld pi = 3.14159265358979;
int main() {
	ll l, n;
	cin >> l >> n;
	vector<ll>a(n);
	rep(i, 0, n)cin >> a[i];
	ll sum = 0;
	ll ans = 0;
	sort(a.begin(), a.end());
	rep(i, 0, n) {
		if (sum + a[i] <= l) {
			ans++;
			sum += a[i];
		}
		else break;
	}
	cout << ans << endl;
}