#include <iostream>
#include <stdlib.h>

int main()
{
	int l, n, w[100];

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

	qsort(w, n, sizeof(int), 0);

	int i = 0, j = 0;

	while (i < n)
	{
		j += w[i];

		if (l > j)
		{
			break;
		}

		i++;
	}

	printf("%d", i);

	return 0;
}