#include <iostream>
#include <queue>
#include <vector>
#include <tuple>
#include <algorithm>

using namespace std;

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

	cout << i << endl;
	return 0;
}