#include<bits/stdc++.h>
using namespace std;

typedef long long s64;
const int D=998244353;
s64 pow_mod(s64 x,int y){
    s64 ans=1;
    while(y){
        if(y&1)ans=ans*x%D;
        x=x*x%D;y>>=1;
    }
    return ans;
}

int main(){
#ifdef kcz
    freopen("1.in","r",stdin);//freopen("1.out","w",stdout);
#endif
    int tt;
    cin>>tt;
    while(tt--){
        int n,k;
        cin>>n>>k;
        vector<int> a;
        for(int i=0;i<n;++i){
            int x;
            scanf("%d",&x);
            a.push_back(x);
        }
        sort(a.begin(),a.end());
        int now=INT_MIN,ans=0;
        for(auto x:a){
            if(now<x+k){
                ++ans;
                now=max(++now,x-k);
            }
        }
        cout<<ans<<endl;
    }
}