#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;

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());
  ll sum = 0;
  for (int i = 0; i < n; i++) {
    sum += w[i];
    if (sum > l) {
      cout << i << endl;
      return 0;
    }
  }
  cout << n << endl;
}