#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

int main() {
	int L, N, Lim, cnt;
	cnt = 0;
	Lim = 0;

	cin >> L;
	cin >> N;

	vector<int> Wi(N);

	for (int i = 0; i < N; i++)
	{
		cin >> Wi[i];
	}

	sort(Wi.begin(), Wi.end());

	for (int i = 0; i < N; i++)
	{
		Lim += Wi[i];
		cnt++;
		if (Lim > L) {
			cout << i << endl;
			break;
		}
		else if (cnt == N) {
			cout << N << endl;
		}

	}

	return 0;
}