#include <bits/stdc++.h>
using namespace std;
int main( ){
   int L,N;
   cin >> L >> N ;
   vector<int> W(N);
   for(int i = 0; i < N ; i++){
       cin >> W.at(i);
   }
    sort(W.begin(),W.end());
    int wide =0;
    int i = 0;
    int count = 0;
    while(wide<=L){
        wide += W.at(i);
        i++;
        count ++;
    }
    cout << count-1 << endl;
}