#include <stdio.h>

void sort(int *x, int left, int right)
{
	int i, j, pivot, mem;

	i = left;
	j = right;

	pivot = x[(left + right) / 2];

	while (1) {
		while (x[i] < pivot)
			i++;
		while (pivot < x[j])
			j--;
		if (i >= j)
			break;

		mem = x[i];
		x[i] = x[j];
		x[j] = mem;
		i++;
		j--;
	}

	if (left < i - 1)
		sort(x, left, i - 1);
	if (j + 1 <  right)
		sort(x, j + 1, right);
}

int main(){
	int L, N, W[10001], i;
	scanf("%d %d", &L, &N);
	for(i = 0; i < N; i++)	scanf("%d", &W[i]);

	sort(W, 0, N - 1);
	i = 0;
	do{
		L -= W[i];
		i++;
	}while(L - W[i] >= 0 && W[i] != 0);

	printf("%d\n", i);
	return 0;
}