#include <bits/stdc++.h>

using namespace std;

template <typename T> inline istream& operator>>(istream &s, vector<T> &v) {
  for (T &t : v) s >> t;
  return s;
}

template <typename T> inline ostream& operator<<(ostream &s, const vector<T> &v) {
  for (T &t : v) s << t << endl;
  return s;
}

template<typename T> void sort(vector<T>& v) {
  sort(v.begin(), v.end());
}

template<typename T> void rsort(vector<T>& v) {
  sort(v.rbegin(), v.rend());
}

template<typename T> void reverse(vector<T>& v) {
  reverse(v.begin(), v.end());
}

template<typename T> void unique(vector<T>& v) {
  v.erase(unique(v.begin(), v.end()), v.end());
}

template<typename T> bool next_permutation(vector<T>& v) {
  return next_permutation(v.begin(), v.end());
}

template<typename T> int lower_bound(vector<T>& v, T t) {
  return lower_bound(v.begin(), v.end(), t) - v.begin();
}

template<typename T> int upper_bound(vector<T>& v, T t) {
  return upper_bound(v.begin(), v.end(), t) - v.begin();
}

template<typename T> void partial_sum(vector<T>& v, vector<T>& u) {
  partial_sum(v.begin(), v.end(), u.begin());
}

int main() {
  int l, n;
  cin >> l >> n;
  vector<int> w(n), v(n);
  cin >> w;
  sort(w);
  partial_sum(w, v);
  cout << upper_bound(v, l) << endl;
}