#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;


int main() {
	int totalSize = 0;
	int l;
	cin >> l;
	int n;
	cin >> n;
	int a[n];

	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	sort(a, a + n);

	int i = 0;
	for (; i < n; i++) {
		if (totalSize + a[i] > l)
			break;
		totalSize += a[i];
	}
	cout << i << endl;
}