#include<iostream>
#include<vector>
using namespace std;

int main(){
  long int l,n,w;
  l=n=0;
  vector<int> wn;
  cin>>l;
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>w;
    wn.push_back(w);
  }
  int count=0;
  while(1){
    int min=l;
    int itr;
    for(int i=0;i<wn.size();i++){
      if(min>wn[i]){
        min=wn[i];
        itr=i;
      }
    }
    l=l-min;
    wn.erase(wn.begin()+itr);
    if(l<0)break;
    if(wn.size()<=0)break;
    count++;
  }
  cout<<count<<endl;
  return 0;
}