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

int main(){
	int l, n, tmp;
	vector<int> w;
	cin >> l >> n;

	for(int i = 0; i < n; i++){
		cin >> tmp;
		w.push_back(tmp);
	}

	sort(w.begin(), w.end());

	int sum = 0;
	for(int i = 0; i < w.size(); i++){
		sum += w[i];
		if(sum > l || i == w.size()-1){
			tmp = i;
			break;
		}
	}
	cout << tmp << endl;
}