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

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