#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=100002,INF=0x3f3f3f3f;
int a[N],T,n,last,ans,k;
int main(){
    scanf("%d",&T);
    while(T--){
        last=-INF;ans=0;
        scanf("%d%d",&n,&k);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        sort(a+1,a+n+1);
        for(int i=1;i<=n;i++){
            if(last>=a[i]+k) continue;
            if(last<a[i]-k) last=a[i]-k-1;
            last++;ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}