#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
int a[maxn];
void solve(){
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    sort(a + 1, a + 1 + n);
    int cnt = 0;
    int last = -2e9;
    for (int i = 1; i <= n; i++) {
        int l = a[i] -  k, r = a[i] + k;
        last = max(last + 1, l);
        if (last <= r){
            cnt++;
        }else{
            last = r;
        }
    }
    cout << cnt << endl;
}
int main(){
    int T;
    cin >> T;
    while (T--) solve();
}