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

int main(void)
{
    int i, l, n, key, sum = 0, max = 0;
    int *w;
    scanf("%d", &l);
    scanf("%d", &n);
    w = (int *)malloc(sizeof(int) * (n + 1));

    for (i = 0; i < n; i++)
    {
        scanf("%d", &w[i]);
    }
    for (i = 1; i < n; i++)
    {
        key = w[i];
        int j = i - 1;
        while (j >= 0 && w[j] > key)
        {
            w[j + 1] = w[j];
            j--;
        }
        w[j + 1] = key;
    }

    for (i = 0; i < n; i++)
    {
        sum = sum + w[i];
        if (sum <= l)
        {
            max++;
        }
    }
    printf("%d", max);
    return 0;
}