#include <algorithm>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <optional>
#include <vector>

using namespace std;

int main() {
    int32_t l, n;
    cin >> l >> n;
    vector<int32_t> ws(n);
    for (auto i = 0; i < n; ++i) {
        cin >> ws[i];
    }
    sort(ws.begin(), ws.end());
    int32_t ans = 0, sum = 0;
    for (auto w : ws) {
        if (sum + w > l)
            break;
        ++ans;
        sum += w;
    }
    cout << ans << endl;
    return 0;
}