#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  int n,m;
  cin >> n >> m;
  vector<int> l(m);
  for(int i=0;i< m ;i++){
    cin >> l[i];
  }
  sort(l.begin(),l.end());
  int sum=0,x=0;
  while(1){
    if(sum>n){

      cout<<x-1<<endl;
      return 0;
    }
    if(x==m){
cout<<x<<endl;
return 0;
}
    sum+=l[x];
    x++;
  }
cout<<x-1<<endl;
  return 0;
}