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

int main(){
  int l, n, i;
  cin >> l >> n;
  vector<int> w(n);
  for(i = 0; i < n; ++i){
    cin >> w[i];
  }
  sort(w.begin(), w.end());
  int cnt = 0;
  while(cnt != n){
    l -= w[cnt];
    if(l < 0)break;
    cnt++;
  }

  cout << cnt << endl;

  return 0;
}