#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cmath>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)

int main(){
  int l,n;
  cin >> l >> n;
  vector<int> w(n);
  rep(i,n) cin >> w[i];
  sort(w.begin(),w.end());
  int sum = 0;
  for (int i = 0; i < n;i++){
    if (sum + w[i] <= l){
      sum += w[i];
    }
    else{
      cout << i << endl;
      return 0;
    }
  }
  cout << n << endl;
  return 0;
}