#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long ll;

int main() {
    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());
        int res = 0;
        int p = -1000000005;
        for (int i = 0; i < n; i++) {
            int l, r;
            l = a[i] - k;
            r = a[i] + k;
            //cout << l << ' ' << r << ' ' << p << endl;
            if (p < r) res += 1;
            p = min(r, max(p + 1, l));
        }
        cout << res << endl;
    }
    return 0;
}