#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

int main() {
	int L, N, W[10000];
	
	cin >> L >> N;
	for (int i = 0; i < N; i++)
	{
		scanf("%d", W+i);
	}
	sort(W, W+N);

	int cnt = 0, sum = 0;
	while (cnt < N)
	{
		sum += W[cnt];
		if (sum > L) break;
		cnt++;
	}
	printf("%d\n", cnt);

	return 0;
}