#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
  int L, n;
  cin >> L >> n;
  vector<int> w(n);
  for (auto& a : w) {
    cin >> a;
  }
  sort(w.begin(), w.end());
  int ans = 0;
  int len = 0;
  for (auto& a : w) {
    len += a;
    if (len > L) break;
    ans++;
  }
  cout << ans << endl;
}