#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[i];
    }
    sort(w.begin(), w.end());

    int sum = 0;
    int result = 0;
    for (int bl: w) {
        sum += bl;
        if (sum > l) break;
        ++result;
    }

    cout << result << endl;
}