#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>

using namespace std;
typedef long long int lint;

int main()
{
	int L, N, tmp, ans = 0;
	vector<int> W;

	cin >> L >> N;

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

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

	for (auto itr = W.begin(); itr != W.end(); itr++) {
		if (L >= *itr) {
			L -= *itr;
			ans++;
		}
		else
			break;
	}

	cout << ans << endl;

	return 0;
}