#include <stdio.h>
#include <stdlib.h>

void quick_sort(int *array, int left, int right);
void change(int &a, int &b);

int main(void)
{
	int l, n, *w, i, sum = 0;
	scanf("%d %d", &l, &n);
	w = (int *)malloc(sizeof(int)*n);

	for (i = 0; i < n; i++) {
		scanf("%d", &w[i]);
	}

	quick_sort(w, 0, n-1);
	
	for (i = 0; l >= sum + w[i] && i < n ; i++) {
		sum += w[i];
	}
	printf("%d\n", i);
	return 0;
}

void quick_sort(int *array, int left, int right){
	if (left >= right) return;
	
	int p = left, k = left+1;
	while (k <= right) {
		if (array[k] < array[left]) {
			change(array[p+1], array[k]);
			p++;
		}
		k++;
	}
	change(array[left], array[p]);
	quick_sort(array, left, p-1);
	quick_sort(array, p+1, right);
}

void change(int &a, int &b){
	int temp = a;
	a = b;
	b = temp;
}