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

int W[10000];

int main()
{
  int L;
  int N;

  cin >> L;
  cin >> N;
  for (int i = 0; i < N; i++)
  {
    cin >> W[i];
  }
  sort(W, W+N);

  int M = 0;
  int i = 0;
  while (M < L)
  {
    M += W[i];
    i++;
  }
  if (M > L) i--;
  cout << i << endl;
  return 0;
}