#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    int L, N;
    cin >> L >> N;
    vector<int> v(N);
    for (int i = 0; i < N; i++) {
        cin >> v[i];
    }

    sort(v.begin(), v.end());

    for (int i = 0; i < v.size(); i++) {
         L -= v[i];
         if(L < 0){
             cout <<  i << endl;
             return 0;
         }
    }

    cout << N << endl;
}