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

using namespace std;
int main()
{
  int L,N;
  cin >> L >> N;
  vector<int> W(N);
  for(int i=0;i<N;++i){
    cin >> W[i];
  }
  sort(W.begin(),W.end());
  int ans = 0;
  for(int i=0;i<N;++i){
    L -= W[i];
    if(L>=0){
      ans++;
    }else{
      break;
    }
  }
  cout << ans << endl;
  return 0;
}