#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

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