#include <stdio.h>
#include <algorithm>
int N,M;
int main(){
    //input
    scanf("%d %d",&N,&M);
    int C[N];
    for (int i = 0;i < N;i++){
        scanf("%d",&C[i]);
    }

    //sort array C
    std::sort(C,C+N);

    //take candy
    int candyTotal = 0;
    for (int i = 0;i < N;i++){
        if (candyTotal < M){
            if (M-candyTotal <= C[i]){
                int tmp = M-candyTotal;
                candyTotal += tmp;
                C[i] -= tmp;
            }else{
                candyTotal += C[i];
                C[i] = 0;
            }
        }else{
            break;
        }
    }

    //count empty box
    int emptyTotal = 0;
    for (int i = 0;i < N;i++){
        if (C[i] == 0){
            emptyTotal++;
        }else{
            break;
        }
    }

    //output
    printf("%d\n",emptyTotal);
    return 0;
}