#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
int main() {
   int L,N;cin>>L>>N;
   vector<int>W(N);
   rep(i,N)cin>>W[i];
   sort(W.begin(),W.end());
   int ans=0;
   rep(i,N){
      L-=W[i];
      if(L<0)break;
      ans++;
   }
   cout<<ans<<endl;
}