#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int l;
	int n;
	cin >> l;
	cin >> n;
	
	vector<int> w(n);
	for(int i = 0; i < n; i++){
		cin >> w[i];
	}
	
	sort(w.begin(), w.end());
	
	int total = 0;
	int count = 0;
	for(int i = 0; i < n; i++){
		if(total + w[i] <= l){
			total += w[i];
			count++;
		} else {
			break;
		}
	}
	
	cout << count << endl;
	
	return 0;
}