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

int main() {
    using namespace std;
    int l, n;
    cin >> l >> n;
    vector<int> w(n);
    for (auto &e : w) { cin >> e; }
    sort(w.begin(), w.end());

    int ans = 0;
    for (auto e : w) {
        if (e < l) {
            l -= e;
            ans++;
        } else {
            break;
        }
    }
    cout << ans << endl;
}