#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int T,n,k,ans,ma,a[100010];
bool cmp(int x,int y){return x<y;}
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&k);
        for(int i=1;i<=n;i++)scanf("%d",&a[i]);
        sort(a+1,a+1+n,cmp);
        ans=0;
        ma=-1e9;
        for(int i=1;i<=n;i++)
        {
            if(a[i]-k>ma)
            {
                ma=a[i]-k;
                ans++;
            }
            else if(a[i]+k>ma)
            {
                ma++;
                ans++;
            }
            else continue;
        }
        printf("%d\n",ans);
    }
    return 0;
}