#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

int main() {
	int N, L;
	vector<int> W;

	cin >> L >> N;
	W.assign(N, 0);
	for (int i = 0; i < N; i++) {
		cin >> W[i];
	}
	sort(W.begin(), W.end());

	int ans = 0;
	int total = 0;

	for (int i = 0; i < N; i++) {
		if (total + W[i] <= L) {
			total += W[i];
			ans++;
		} else {
			break;
		}
	}

	cout << ans << endl;
	return 0;
}