#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdlib>
#include<ctime>
using namespace std;
typedef long long ll;
int main() {
	int l, n, a[10010], ans = 0;
	cin >> l >> n;
	for (int i = 0; i < n; i++)cin >> a[i];
	sort(a, a + n);
	for (int i = 0;; i++) {
		l -= a[i];
		if (l < 0)break;
		ans++;
	}
	cout << ans << endl;
	return 0;
}