#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>

using namespace std;

int L, N;
multiset<int> box;

int main() {
	int i;
	int count = 0;

	cin >> L;
	cin >> N;
	for (i = 0; i < N; i++) {
		int input;
		cin >> input;
		box.insert(input);
	}

	while (!box.empty() && L > 0) {
		multiset<int>::iterator it = box.begin();
		if (L >= (*it)) {
			L -= (*it);
			box.erase(it);
			count++;
		} else break;
	}

	cout << count << endl;

	return 0;
}