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

int T, n, k, a[101000];

int main(){
    for (cin>>T;T--;){
        cin>>n>>k;
        for (int i=1;i<=n;++i) scanf("%d",&a[i]);
        sort(a+1,a+n+1);
        int las=-2e9, ans=0;
        for (int i=1;i<=n;++i){
            int l=a[i]-k, r=a[i]+k;
            int t=max(las+1,l);
            if (t<=r){
                las=t; ++ans;
            }
        }
        cout<<ans<<endl;
    }
}