#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <math.h>
#include <iomanip>
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;

int a, b, k[100005], ans;
int main() {
	cin >> a >> b;
	for (int i = 0; i < b; ++i) { cin >> k[i]; }
	sort(k, k + b);
	for (int i = 0; i < b; ++i) {
		ans += k[i];
		if (ans > a) {
			cout << i << endl;
			return 0;
		}
	}
}