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

const int N = 100000 + 9;

int a[N];

void solve() {
    int n, k;
    scanf("%d %d", &n, &k);
    for (int i = 1; i <= n; ++i) scanf("%d", a + i);
    sort(a + 1, a + n + 1);
    int pre = a[1] - k;
    int ans = 1;
    for (int i = 2; i <= n; ++i) {
        int cur = max(pre + 1, a[i] - k);
        if (cur <= a[i] + k) {
            ++ans;
            pre = cur;
        }
    }
    printf("%d\n", ans);
}

int main() {
    int T; scanf("%d", &T);
    while (T--) solve();
    return 0;
}