#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < n; i++)
typedef long long ll;
// Welcome to my source code!

int main() {
    int l, n;
    cin >> l >> n;
    int w[n];
    REP(i,n) cin >> w[i];
    sort(w, w+n);
    int cnt = 0, rem = l;
    REP(i,n) {
        if (rem - w[i] >= 0) {
            rem -= w[i];
            cnt++;
        } else break;
    }
    cout << cnt << endl;
}