#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;++i)
#define per(i,s,t) for(int i=s;i>t;--i)
#define dd(x) cout<<#x<<" = "<<x<<" "
#define de(x) cout<<#x<<" = "<<x<<"\n"
#define sz(x) x.size()
#define pb push_back
#define lson k<<1,l,mid
#define rson k<<1|1,mid+1,r
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
const int N=4e5+11;
const int mod=998244353;
int a[N],b[N];
int T,n,k;
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&k);
        rep(i,1,n)
            scanf("%d",a+i);
        sort(a+1,a+n+1);
        int p=a[1]-k;
        int ans=0;
        b[0]=-(1e9)-1;
        rep(i,1,n){
            if(p<a[i]-k)p=a[i]-k;
            if(p>a[i]+k)p=a[i]+k; 
            b[i]=p;
            if(abs(a[i]-b[i])<=k&&(b[i]!=b[i-1]))
                ++ans;
            ++p;
        }
        printf("%d\n",ans);
    }
    return 0;
}