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

int main() {
    int l, n;
    cin >> l >> n;
    vector<int> w(n);
    rep(i, n) cin >> w[i];
    sort(all(w));
    int cnt = 0;
    int res = 0;
    for (int i = 0; i < n; i++) {
        res += w[i];
        if (res <= l)
            cnt++;
        else
            break;
    }
    cout << cnt << endl;
    return 0;
}