#include<bits/stdc++.h>
#define endl '\n'
using namespace std;

const int MAXN=1e5+5;

int n,d;
int a[MAXN];
vector<int>u;
vector<int>v;

bool check(int idx)
{
    int s=0;
    int b=d-a[idx];
    for(int i=u.size()-1;i>=0;i--)
    {
        if(s>=b && s<d) return 1;
        int t=min((b-s)/a[u[i]],v[i]);
        s+=t*a[u[i]];
    }
    return 0;
}

int main()
{
freopen("parties.in","r",stdin);
freopen("parties.out","w",stdout);

cin>>n>>d;
for(int i=1;i<=n;i++)
{
    cin>>a[i];
}
sort(a+1,a+n+1);
u.push_back(1);
for(int i=2;i<=n;i++)
{
    if(a[i]!=a[i-1]) u.push_back(i);
}

for(int i=1;i<u.size();i++)
{
    v.push_back(u[i]-u[i-1]);
}
v.push_back(n+1-u.back());

int l=0,r=u.size()-1;
while(l<r)
{
    int mid=(l+r)/2;
    if(check(u[mid])) r=mid;
    else l=mid+1;
}

int ans=0;
for(int i=l;i<u.size();i++)
{
    ans+=v[i];
}

cout<<ans<<endl;
return 0;
}