#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int val[100010];
set<int> order;
int main()
{
    int n,d,cntr=0,ans=0;
    long long sum=0,diff,rem=0;
    FILE *F;
    F=fopen("parties.in","rt");
    fscanf(F,"%d %d",&n,&d);
    for(int i=0;i<n;i++)
    {
        fscanf(F,"%d",&val[i]);
        sum+=val[i];
        order.insert(val[i]);
    }
    fclose(F);
    F=fopen("parties.out","wt");
    if(sum<d){fprintf(F,"%d",0);fclose(F);return 0;}
    else {fprintf(F,"%d",n);fclose(F);return 0;}

    /*for(int i=0;i<n;i++)
    {
        if(sum-val[i]<d)ans++;
        else sum-=val[i];
    }
    fprintf(F,"%d",ans);
    fclose(F);*/
}
/*sum+=val[i];
if(sum>=d){ans=n-cntr;break;}
else cntr++;*/
/*
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int val[100010];
int main()
{
    int n,d,cntr=0,ans=0;
    long long sum=0;
    FILE *F;
    F=fopen("parties.in","rt");
    fscanf(F,"%d %d",&n,&d);
    for(int i=0;i<n;i++)
    {
        fscanf(F,"%d",&val[i]);
        sum+=val[i];
    }
    fclose(F);
    F=fopen("parties.out","wt");
    if(sum<d){fprintf(F,"%d",0);fclose(F);return 0;}
    if(sum==d){fprintf(F,"%d",n);fclose(F);return 0;}
    sort(val,val+n);
    for(int i=n-1;i>=0;i--)
    {
        if(sum-val[i]<d)ans++;
        else sum-=val[i];
    }
    fprintf(F,"%d",ans);
    fclose(F);
}
*/