#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int T;
int a[maxn];


int main()
{
    scanf("%d", &T);
    while(T--)
    {
        int n, k;
        memset(a, 0, sizeof(a));
        scanf("%d%d", &n, &k);
        for(int i=0; i<n; i++)
        {
            scanf("%d", &a[i]);
        }
        sort(a, a+n);
        int count_ = 0;
        int min_ = -1e9;
        for(int i=0; i<n; i++)
        {
            int l = a[i] - k;
            int r = a[i] + k;
            if(min_ < l)
            {
                min_ = l;
                count_++;
            }
            else if(min_ >= r)
            {
                continue;
            }
            else if(min_ >= l && min_ < r)
            {
                min_ += 1;
                count_ ++;
            }
        }
        printf("%d\n", count_);
    }

    return 0;
}