#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main () {
int L;
int N;
cin >> L >> N;

vector<int> W(N);
for (int i = 0 ; i <  N; ++i) {
cin >> W[i];
}
sort(W.begin(), W.end());

int sum = 0;
for (int i  = 0; i < N; ++i) {
if (sum + W[i] > L) {
 cout << i << endl;
 return 0;
}
 sum += W[i];
}

cout << 0 << endl;
return 0;

}