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

int main()
{
  int l, n, w[10001];
  cin >> l >> n;
  for (int i = 0; i < n; i++) {
    cin >> w[i];
  }
  sort(w, w + n);
  int space = l;
  int cnt;
  for (int i = 0; i < n && space >= w[i]; i++) {
    space -= w[i];
    cnt = i;
  }
  cout << cnt + 1 << endl; 
  return 0;
}