#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
#define sc(x) scanf("%d",&x)
using namespace std;

int a[100010];
int tl, tr;

int main(void) {
    int t; sc(t);
    while (t--) {
        int n, k; sc(n); sc(k);
        for (int i = 1; i <= n; i++)sc(a[i]);
        sort(a + 1, a + n + 1);
        tl = 0; tr = 1000000001;
        int ans(0), p(0);
        a[0] = -1;
        for (int i = 1; i <= n; i++) {

            int l = a[i] - k;
            int r = a[i] + k;
            
            if (i == 1) {
                ans++;
                p = l;
            }
            else if (l == tl && r == tr) {
                if (p < r) {
                    ans++; p++;
                }
            }
            else if (l > tl && l <= tr) {
                if (p >= l && p <= r) {
                    ans++; p++;
                }
                else if (p < l) {
                    p = l; ans++;
                }
            }
            else if (l > tr) {
                p = l;
                ans++;
            }



            tl = l; tr = r;
        }
        if (ans <= n)
            printf("%d\n", ans);
        else printf("%d\n", n);
    }
    return 0;
}