#include <stdio.h>

void Quicksort(int data[], int left, int right){
    int l = left, r = right;
    int pivot = data[(left + right) / 2];
    int temp;

    while(1){
        while (data[l] < pivot) l++;
        while (pivot < data[r]) r--;
        if(r < l) break;

        temp = data[l];
        data[l] = data[r];
        data[r] = temp;

        l++, r--;
    }
    if(left < r)  Quicksort(data, left, r);
    if(l < right) Quicksort(data, l, right);
}

int main(void){
    int i, N, M, ans = 0;
    scanf("%d %d", &N, &M);
    int c[N];
    for (i=0;i<N;i++) scanf("%d", &c[i]);
    Quicksort(c, 0, N-1);
    i = 0;
    while(M>0 && i<N){
        if(c[i]>M){
            M = 0;
        }else{
            M -= c[i];
            ans++;
        }
        i++;
    }
    printf("%d\n", ans);
    return 0;
}