#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

void read(int &x) {
    x = 0; char c = getchar();
    while (c < '0' || c > '9') c = getchar();
    while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
}

typedef long long ll;

const int N = 1e5 + 100;

int n, k;
int sa[N];

int main() {
    int T; read(T);
    while (T--) {
        read(n); read(k);
        for (int i = 1; i <= n; i++) read(sa[i]);
        sort(sa + 1, sa + n + 1);
        int p = -1e9 - 100, ans = 0;
        for (int i = 1; i <= n; i++) {
            int l = sa[i] - k, r = sa[i] + k;
            if (p >= r) continue;
            if (p < l) p = l;
            else p++;
            ans++;
        }
        printf("%d\n", ans);
    }
    return 0;
}