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

const int MOD = 998244353;

int mult(int x, int y) {
    return int64_t(x) * y % MOD;
}

int qpow(int a, int t) {
    int b = 1;
    for (; t > 0; t /= 2, a = mult(a, a)) {
        if (t & 1) {
            b = mult(b, a);
        }
    }
    return b;
}

int main(int argc, char **argv) {
    cin.sync_with_stdio(false), cin.tie(nullptr);
    
    int t;
    cin >> t;

    while (t--) {
        int n, k;
        cin >> n >> k;

        vector<int> a(n);

        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }

        sort(a.begin(), a.end());

        if (k == 0) {
            int ans = 1;

            for (int i = 1; i < n; i++) {
                ans += a[i] != a[i - 1];
            }

            cout << ans << "\n";
            continue;
        }

        int ans = 1;

        for (int i = 1, last = a[0] - k, cur = a[0] - k; i < n; i++) {
            const int low = a[i] - k, high = a[i] + k;

            cur = max(cur, low);

            if (cur == last && cur < high) {
                ++cur;
            }

            ans += cur != last;
            last = cur;
        }

        cout << ans << "\n";
    }
}