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

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

int main(void)
{
    int N, M;
    int C[10];
    int i, count;

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

    qsort(C, N, sizeof(int), asc);

    count = 0;
    for (i = 0; i < N; i++) {
        M -= C[i];
        if (M == 0) {
            count = i + 1;
            break;
        } else if (M < 0) {
            count = i;
            break;
        }
    }

    printf("%d\n", count);

    return 0;
}