#include <iostream>
#include <cstdio>
#include <algorithm>
#include <memory.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define M 100005
const long long mod=998244353;
ll n,k;
ll MAX,MIN,sum,res;
int a[M];
void f()
{
    for(int i=n;i>=1;i--){
        if(res>a[i]+k) res=a[i]+k;
        if(res<a[i]-k) continue;
        if(res<MIN-k||i==0) return;
        if(res<=a[i]+k&&res>=a[i]-k){
        sum++;
        res--;
        }
    }
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        MAX=0;
        MIN=inf;
        sum=0;
        scanf("%lld%lld",&n,&k);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            if(a[i]>MAX) MAX=a[i];
            if(a[i]<MIN) MIN=a[i];
        }
        res=MAX+k;
        sort(a+1,a+n+1);
        f();
        cout<<sum<<endl;
    }
    return 0;
}