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

int main(void) {
    int L, N, i, j, k, temp, count, length;

    scanf("%d", &L);
    scanf("%d", &N);
    //printf("%d\n", N);
    int *W = malloc(sizeof(int) * N);
    for (i = 0; i < N; i++) {
        scanf("%d", &W[i]);
        //printf("a\n");
    }
    /*for(i = 0; i < N; i++) {
        printf("%d ", W[i]);
    }*/
    //printf("bb\n");
    /*for (i = 0; i < N; N++) {
        printf("%d ", W[i]);
    }
    printf("\n");*/
    for (i = 0; i < N - 1; i++) {
        for (j = 0; j < N - i - 1; j++) {
            if (W[j] > W[j + 1]) {
                temp = W[j];
                W[j] = W[j + 1];
                W[j + 1] = temp;
            }
        }
        /*for (k = 0; k < N; k++) {
            printf("%d ", W[k]);
        }
        printf("\n");*/
    }
    /*printf("After Sorting\n");
    for (i = 0; i < N; i++) {
        printf("%d ", W[i]);
    }
    printf("\n");*/
    i = 0;
    length = 0;
    while ((N > i) && ((length += W[i]) <= L)) {
        i++;
    }
    printf("%d\n", i);
    free(W);

    return 0;
}