#include <stdio.h>
#include <stdlib.h>

int comp(const void *a, const void *b)
{
  return *(int*)a - *(int*) b;
}

int main()
{
  int i;
  int L, N;
  int length = 0, count = 0;

  scanf("%d%d\n", &L, &N);

  int w[N];

  for (i = 0; i < N; i++) {
    scanf("%d", &w[i]);
  }

  qsort(w, N, sizeof(int), comp);

  while (length < L) {
    length += w[count];
    count++;
  }

  if (length == L) count++;
  
  printf("%d\n", count - 1);

  return 0;
}