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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    int n,k;
    while(cin>>n>>k)
    {
        int a[n+5];
        int book[n+5]= {0};
        for(int i=0; i<n; i++)
        {
            cin>>a[i];
        }
        sort(a,a+n);
        for(int i=0; i<n; i++)
        {
            if(book[i]==0)
            {
                for(int j=i+1; j<n; j++)
                {
                    if(book[j])
                    {
                        continue;
                    }
                    else if(a[j]<=a[i]+k)
                    {
                        book[i]=1;
                        break;
                    }
                }
            }
            else
            {
                continue;
            }
        }
        int cnt=0;
        sort(book,book+n);
        for(int i=0; i<n; i++)
        {
            if(book[i]==0)
            {
                cnt++;
            }
            else
            {
                break;
            }
        }
        cout<<cnt<<endl;
    }
    return 0;
}
