/**
*    author:  boutarou
*    created: 02.08.2020 11:44:42
**/

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using ll = long long;
using P = pair<int, int>;

int main() {
    int l, n;
    cin >> l >> n;
    vector<int>w(n);
    rep(i, n) cin >> w[i];
    sort(w.begin(), w.end());
    rep(i, n) {
        l -= w[i];
        if (l < 0) {
            cout << i << endl;
            return 0;
        }
    }
    cout << n << endl;
    return 0;
}