#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

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