#include <iostream>
#include <algorithm>
using namespace std;
#define N 10000

int main(void){
	int L_width;
	int block_nums;
	int block[N];
	int sum = 0,num=0;
	cin >> L_width; //width of bigblock
	cin >> block_nums; //number of block
	for(int i=0;i<block_nums;i++){
		cin >> block[i];
	}
	sort(block,block+block_nums); //sort

	for(int i=0;i<block_nums;i++){
		sum+=block[i];
		if(sum>L_width)
			break;
		num++;
	}

	cout << num << endl;
	return 0;
}