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

int main(void){
  int n,l,ans;
  vector<int> v;
  
  ans = 0;
  cin >> l >> n;
  for (int i=0; i<n; i++){
    int t; cin >> t;
    v.push_back(t);
  }
  sort(v.begin(), v.end());
  ans = 0;
  for (int i=0; i<n; i++){
    l -= v[i];
    if (l>=0) ans++;
    else break;
  }
  cout << ans << endl;
  return 0;
}