2 1
1 1
 4 1
2 2 1 1
 10 1
2 6 3 4 2 4 4 3 2 1
 2 1
999152 999153
 8 1000000
1 1 5 1000000 1000000 2 2 2
 9 2
1 6 1 5 5 8 6 8 7
 15 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 1 4
8
 10 1
6 3 1 3 6 4 1 3 6 4
 10 1
1 2 3 5 6 8 10 11 9 4
 7 2
1 5 5 8 9 8 8
 2 1000000
1 1000000
 8 2
3 13 9 8 3 13 9 14
 1 1
1
 2 1
1 2

2
 2
 4
 1
 2
 4
 15
 1
 7
 2
 4
 1
 5
 1
 1

#include<bits/stdc++.h>
using namespace std;
#define int long long
main()
{
    int n,k,j;
    cin>>n>>k;
    int x,i,rin,lin,val;
    vector<int>v;
    for(i=0;i<n;i++)
    {
    cin>>x;
    v.push_back(x);
    }
    sort(v.begin(),v.end());
    int m[n+3]={0};
    int l[n+3],r[n+3];
    vector<pair<int,int> >diff;
    for(i=0;i<n;i++)
    {
        lin=lower_bound(v.begin(),v.end(),v[i]-k)-v.begin();
        rin=upper_bound(v.begin(),v.end(),v[i]+k)-v.begin();
        diff.push_back(make_pair(rin-lin,i));
        l[i]=lin;
        r[i]=rin-1;
        if(v[lin]==v[i])
            l[i]=lin;
        if(v[rin-1]==v[i])
            r[i]=rin-1;
    }

    sort(diff.begin(),diff.end());
    reverse(diff.begin(),diff.end());
    vector<pair<int,int> >::iterator  it;
    for(it=diff.begin();it!=diff.end();it++)
    {
        lin=l[it->second];
        rin=r[it->second];
        for(j=lin;j<it->second;j++)
        {
            if(v[it->second]!=v[j])
            m[j]=1;
            val=l[j];
            for(k=val;k<lin;k++)
                {
                    if(v[k]!=v[j])
                    m[k]=1;
                }
        }
        for(j=rin;j>it->second;j--)
        {
            val=r[j];
            for(k=val;k>rin;k--)
               {
                           if(v[k]!=v[j])
                            m[k]=1;
                }
        }
    }
    int ans=0;
    for(i=0;i<n;i++)
        if(!m[i])
        ans++;
    cout<<ans<<endl;
}
