#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
    int l, n; cin >> l >> n;
    vector<int> w(n);
    for(int i = 0; i < n; i++) {
        cin >> w.at(i);
    }
    sort(w.begin(), w.end());
    int c = 0, j = 0;
    while (c <= l) {
        c += w.at(j);
        j++;
    }
    cout << j - 1 << endl;
}