#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;

void read(int &data){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=f*-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        x=x*10+ch-'0';
        ch=getchar();
    }
    data=x*f;
}

void write(int x){
    if(x>10) write(x/10);
    putchar(x%10);
}

int fpow(int a,int p){
    int res=1;
    while(p){
        if(p&1) res=res*a%mod;
        a=a*a%mod;
        p>>=1;
    }
    return res%mod;
}

int t,n,k,ans,a[100005],b[100005];

signed main(){
    cin>>t;
    while(t--){
        ans=0;
        map<int,bool>mp;
        cin>>n>>k;
        for(int i=1;i<=n;i++) cin>>a[i];
        sort(a+1,a+1+n);
        for(int i=1;i<=n;i++){
            if(!mp[a[i]-k]){
                b[i]=a[i]-k;
                mp[a[i]-k]=1; 
            }else{
                b[i]=b[i-1]+1;
                mp[b[i]]=1;
            }
            if(abs(a[i]-b[i])>k){
                ans++;
                b[i]=b[i-1];
            }
        }
        //for(int i=1;i<=n;i++) cout<<a[i]<<" ";
        //cout<<endl;
        //for(int i=1;i<=n;i++) cout<<b[i]<<" ";
        //cout<<endl;
        cout<<n-ans<<endl;
    }
    return 0;
}