#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int w[10010];
int main() {
	int l, n;
	cin >> l >> n;
	for (int i = 0; i < n; i++) {
		cin >> w[i];
	}
	sort(w, w + n);
	int co = 0;
	for (int i = 0; i < n; i++) {
		co += w[i];
		if (co > l) {
			cout << i << endl;
			return 0;
		}
	}
	cout << n << endl;
	return 0;
}