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

using namespace std;

int main(void)
{
  int L, N;
  int s = 0, cnt = 0;
  vector<int> w;

  cin >> L >> N;
  for (int i = 0; i < N; i++) {
    int tmp;
    cin >> tmp;
    w.push_back(tmp);
  }
  sort(w.begin(), w.end());

  {
    int i;
    for (i = 0; i < N; i++) {
      if (s + w[i] <= L) {
        s += w[i];
      } else {
        break;
      }
    }
    cout << i << endl;
  }
}