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

int n, k, a[100005];

void solve() {
    scanf("%d %d", &n, &k);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    sort(a + 1, a + n + 1);
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        if (i == 1) {
            a[i] -= k;
            ans++;
        } else {
            int t = a[i] - (a[i - 1] + 1);
            t = -t;
            if (t < -k) t = -k;
            if (t > k) t = k;
            a[i] += t;
            if (a[i] != a[i - 1]) ans++;
        }
    }
    printf("%d\n", ans);
}

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