#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>

const int MAX_N = 100010;

int T, n;
long long k, a[MAX_N];

int main() {
    std::ios::sync_with_stdio(false);
    std::cin >> T;
    while (T--) {
        std::cin >> n >> k;
        for (int i = 1; i <= n; i++) std::cin >> a[i];
        std::sort(a + 1, a + n + 1);
        int ans = 1;
        long long last = a[1] - k;
        for (int i = 2; i <= n; i++) {
            if (last + 1 <= a[i] + k) {
                last = std::max(last + 1, a[i] - k);
                ans++;
            }
        }
        std::cout << ans << std::endl;
    }
    return 0;
}