#include <stdio.h>
#include <algorithm>
#include <deque>
using namespace std;
using ll = long long;

void solve();
int main() {
	solve();
#ifdef DBG
	while (true);
#endif
}

//5
void solve() {
	int l, n, w[10000];
	scanf("%d %d", &l, &n);
	for (int i = 0; i < n; i++)
		scanf("%d", w + i);
	sort(w, w + n);
	int c, total = 0;
	for (c = 0; c < n; c++) {
		if (l < total + w[c])
			break;
		total += w[c];
	}
	printf("%d\n", c);
}