#include <iostream>
#include <algorithm>
using namespace std;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
int main(){
    int L,N,W[10000],t=0;
    cin>>L>>N;
    REP(i,N) cin>>W[i];
    sort(W,W+N);
    int n = N;
    REP(i,N){
        t += W[i];
        if(t > L){ n = i; break; }
    }
    cout << n << endl;
}