#include <bits/stdc++.h>
using namespace std;

int main() {
  int l, n;
  vector<int> w;
  int a, b = 0;

  cin >> l >> n;
  for (int i = 0; i < n; i++) {
    cin >> a;
    w.push_back(a);
  }
  sort(w.begin(), w.end());
  for (int i = 0; i < n; i++) {
    if (l < w[i]) {
      b = i;
      break;
    }
    l -= w[i];
  }
  if (b != 0) {
    cout << b << endl;
  } else {
    cout << n << endl;
  }
}