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

using namespace std;

int main(int argc, char const* argv[]) {
    int l, n;

    cin >> l;
    cin >> n;

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

    sort(w.begin(), w.end());

    int total = 0, ans = 0;
    for (int i = 0; i < n; i++) {
        total += w[i];
        if (total > l) break;
        ans++;
    }

    cout << ans << endl;
    return 0;
}