#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<cmath>
#include<map>

using namespace std;
typedef long long ll;
const int mod=998244353;
const int maxn=1e5+5;
int a[maxn];

namespace IO{
    char buf[1<<20],*P1=buf,*P2=buf;
    #define gc() getchar()
    //#define gc() (P1==P2&&(P2=(P1=buf)+fread(buf,1,1<<20,stdin),P1==P2)?EOF:*P1++)
    #define TT template<class T>inline
    TT void read(T&x)
    {
        x=0;register char c=gc();register bool f=0;
        while(c<48||c>57){f^=c=='-',c=gc();}
        while(47<c&&c<58)x=(x<<3)+(x<<1)+(c^48),c=gc();
        if(f)x=-x;
    }
    inline void write(ll x)
    {
        int t[20]={0},cnt=0;
        while(x)t[++cnt]=x%10,x/=10;
        if(!cnt)putchar('0');
        else while(cnt)putchar(t[cnt--]+'0');
        puts("");
    }
};
using namespace IO;

ll qpow(ll a,ll b)
{
    ll ans=1;
    while(b)
    {
        if(b&1)ans=ans*a%mod;
        b>>=1; a=a*a%mod;
    }
    return ans;
}

int main()
{
    int t; read(t);
    while(t--)
    {
        map<ll,int>mp;
        int n,k; read(n),read(k);
        for(int i=1;i<=n;i++)read(a[i]);
        sort(a+1,a+1+n);
        int l=a[1]-k-1,ans=0;
        for(int i=1;i<=n;i++)
        {
            l=max(l,a[i]-k);
            while(mp.find(l)!=mp.end()&&l<=a[i]+k)l++;
            if(l<=a[i]+k)mp[l]=1,ans++,l++;
        }
        write(ans);
    }
    return 0;
}