#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
void read()
{
	freopen("parties.in","r",stdin);
    freopen("parties.out","w",stdout);
}
ll i,j,p,q,n,m,k,a[100006],d,br;
void solve()
{
    ll sum  = 0;
    scanf("%lld %lld",&n,&d);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
        sum+=a[i];
    }
    sort(a+1,a+n+1);
    br=0;
    p=0;
    for(j=n;a[j]>=d && j>=1;j--,br++);
    if(br>0)
    {
        cout<<br<<endl;
        return ;
    }
    j=n+1;
    ///vsichki sa po - malki ot d
    for(i=n;i>=1;i--)
    {
        p+=a[i];
        if(p>=d)
        {
            j=i;
            p-=a[i];
        }
    }
    cout<<n-j+1<<endl;
}
int main()
{
	read();
	int T=1;
    while(T--)
        solve();
	return 0;
}