#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for(int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int l, n;
    cin >> l >> n;
    vector<int> w(n);
    REP(i, n)cin >> w[i];
    VSORT(w);

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