#include<stdio.h>
void selectionSort(int nums[], int len);
int main(void){
	int l, n, w[10000], i, j, cnt = 0;
	scanf("%d", &l);
	scanf("%d", &n);
	for(i = 0 ; i < n ; i++){
		scanf("%d", &w[i]);
	}
	selectionSort(w, n);
	for(j = 0 ; j < n ; j++){
		if(l-w[j] >= 0){
			l -= w[j];
			cnt++;
		}else{
			break;
		}
	}
	printf("%d\n", cnt);
	return 0;
}

void selectionSort(int nums[], int len){
	int m, n, tmp;
	for(m = 0 ; m < len-1 ; m++){
		for(n = m+1 ; n < len ; n++){
			if(nums[m] > nums[n]){
				tmp = nums[n];
				nums[n] = nums[m];
				nums[m] = tmp;
			}
		}
	}		
}