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

#define L_MAX 10000
#define N_MAX 10000

int L, N;
int W[N_MAX];

int main() {
	scanf("%d%d", &L, &N);
	for (int i = 0; i < N; i++) scanf("%d", W + i);
	
	sort(W, W + N);
	
	int res = 0;
	for (int i = 0; i < N; i++) {
		if (W[i] <= L) {
			L -= W[i];
			res++;
		} else {
			break;
		}
	}
	
	printf("%d\n", res);
	
	return 0;
}