#include<bits/stdc++.h>
using namespace std;
const int M=1e5+5;

int n,K,A[M],B[M];

void Solve()
{
    sort(A+1,A+n+1);
    int lo=-2e9,ans=0;
    for(int i=1;i<=n;i++)
    {
        if(lo<A[i]-K)lo=A[i]-K;
        else if(lo<A[i]+K)lo++;
        B[i]=lo;
        if(i==1 || B[i]!=B[i-1])ans++;
    }
    printf("%d\n",ans);
}

int main()
{
    int T;scanf("%d",&T);
    while(T --> 0)
    {
        scanf("%d%d",&n,&K);
        for(int i=1;i<=n;i++)scanf("%d",&A[i]);
        Solve();
    }
    return 0;
}