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

using namespace std;

int main(){
  int l,n;
  vector<int> w;

  cin>>l;
  cin>>n;

  w.resize(n);
  for(int i=0;i<n;i++){
    cin>>w[i];
  }

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

  int ans = 0;
  int total = 0;
  
  for(ans = 0; ans<n && total<=l; ans++){
    total += w[ans];
  }

  if(total > l)
    ans -= 1;
  
  cout<<ans<<endl;
  return 0;
}