#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main() {
  int l, n;
  cin >> l >> n;
  vector<int> w(n);
  for (int i = 0; i < n; ++i) cin >> w[i];

  sort(w.begin(), w.end());
  int ans = 0;
  for (int i = 0; i < n; ++i) {
    if (w[i] > l) break;
    ans++;
    l -= w[i];
  }
  cout << ans << '\n';
  return 0;
}