#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using Graph = vector<vector<int>>;
using ll = long long;
//正解に近いコードはこちらに移しておく

int main() {
    int l,n; cin >> l >> n;
    vector<int> W(n);
    rep(i,n) cin >> W[i];
    sort(W.begin(),W.end());
    int cnt = 0;
    int sum = 0;
    for (int i = 0; i < n;i++) {
        sum += W[i];
        if (sum <= l) {
            cnt += 1;
        }
        else {
            break;
        }
    }
    cout << cnt << endl;
}