/*
 * yuki5.cpp
 *
 *  Created on: 2016/12/21
 *      Author: zzz
 */

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

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

	deque<int> di;
	int i;
	for(i=0; i<n; ++i) {
		cin >> w;
		di.push_back(w);
	}
	sort(di.begin(), di.end());
	int sum=0;
	for(i=0; i<di.size(); ++i) {
		if(sum+di[i] <= l) {
			sum += di[i];
		}else {
			break;
		}
	}
	cout << i;
	return 0;
}