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

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