#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T>
using V = std::vector<T>;
#define REP(i, n) for (ll i = (ll)0; i < (ll)(n); i++)
#define REPS(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define RREP(i, n) for (ll i = (ll)(n); i > (ll)0; i--)
#define RREPS(i, s, n) for (ll i = (ll)(n); i > (ll)(s); i--)
#define ALL(c) std::begin((c)), std::end((c))
struct io {
    io() { cin.tie(0)->sync_with_stdio(0); }
} caller;

int main() {
    int l, n;
    cin >> l >> n;

    V<int> w(n);
    REP (i, n) cin >> w[i];

    sort(ALL(w));

    int sum = 0;
    REP (i, n) {
        sum += w[i];
        if (sum > l) {
            cout << i << endl;
            return 0;
        }
    }

    cout << n << endl;

    return 0;
}