#include <iostream>
#include <algorithm>
#include <vector>

int main() {
  int l, n;
  int sum = 0;
  int count = 0;
  std::cin >> l >> n;
  std::vector<int> w;
  for (int i = 0; i < n; i++) {
    int t;
    std::cin >> t;
    w.push_back(t);
  }

  std::sort(w.begin(), w.end());
  for (auto itr = w.begin(); itr != w.end(); itr++) {
	sum += *itr;
    if (sum >= l) {
      break;
    }
      count++;
  }
  std::cout << count << std::endl;
  return 0;
}