#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[i];
  }
  if(accumulate(w.begin(),w.end(),0)<=l){
    cout << n << endl;
    return 0;
  }
  sort(w.begin(),w.end());
  int ans =0;
  int last;
  while(ans<l){
    last = w.back();
    w.pop_back();
    ans += last;
  }
  cout << ans-last << endl;
    
  return 0;
}