#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int L, N; cin >> L >> N;
    vector<int> W(N); for(int i=0;i<N;i++) cin >> W[i];
    sort(W.begin(), W.end());
    int ans = 0;
    for(int i=0;i<N;i++) {
        if(L - W[i] >= 0) {
            ans++;
            L -= W[i];
        }else break;
    }
    cout << ans << endl;
}