#include <bits/stdc++.h>
using namespace std;

#define int long long
#define debug(x) cout<<#x<<" "<<x<<endl;

const int N=1e6+5;
const double eps=1e-9;
const int INF=1e18;

int n,k;
int a[N];
map<int,int> v;

void work()
{
    scanf("%lld%lld",&n,&k);
    v.clear();
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
    sort(a+1,a+1+n);
    int x=0;
    int mi=-1e12;
    for(int i=1;i<=n;i++){
        for(int j=max(mi,a[i]-k);j<=a[i]+k;j++)
        {
            if(!v[j])
            {
                v[j]=1;x++;
                mi=j+1;
                break;
            }
        }
    }
    printf("%lld\n",x);
}

signed main()
{
    int t;cin>>t;
    while(t--)
    {
        work();
    }
    return 0;
}