#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

#define REP(i, n) for((i) = 0; (i) < (n); (i)++)

int main(void){
	int l, n, i;
	int w[10000];
	cin >> l >> n;
	
	REP(i, n) cin >> w[i];

	sort(w, w + n);

	int sum = 0, count = 0;
	
	REP(i, n){
		if (sum + w[i] <= l){
			sum += w[i];
			count++;
		}
		else{
			break;
		}
	}

	cout << count << endl;

	return 0;
}