#include <bits/stdc++.h>

#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define INF 2000000000

#ifdef LOCAL
  #define eprintf(...) fprintf(stdout, __VA_ARGS__)
#else
  #define eprintf(...) 0
#endif

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int uint;

int main() {
  int l, n;
  cin >> l >> n;
  vector<int> v(n);
  REP(i, n) {
    cin >> v[i];
  }
  sort(ALL(v));
  int ans = 0;
  int tmp = 0;
  REP(i, n) {
    tmp += v[i];
    if(tmp > l) break;
    ans++;
  }
  cout << ans << endl;

  return 0;
}