#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
void solve() {
    int n, k;
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    if (k >= n / 2) {
        printf("%d\n", n);
        return;
    }
    sort(a + 1, a + 1 + n);
    int cnt = 1;
    int flag = a[1] - k;
    for (int i = 2; i <= n; i++) {
        if(flag<a[i]-k)flag=a[i]-k,++cnt;
        else if(flag>=a[i]-k&&flag<a[i]+k)++flag,++cnt;
    }
    printf("%d\n", cnt);
}
int main() {
    int T;
    scanf("%d",&T);
    while (T--) {
        solve();
    }
    return 0;
}