#include <cstdio>
#include <algorithm>
#include <vector>

int main() {
  int l;
  size_t n;
  scanf("%d %zu", &l, &n);

  std::vector<int> w(n);
  for (auto& wi: w) scanf("%d", &wi);
  std::sort(w.begin(), w.end());

  int acc = 0;
  for (size_t i = 0; i < n; ++i) {
    acc += w[i];
    if (acc > l) return !printf("%zu\n", i);
  }
  printf("%zu\n", n);
}