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

const int N = 1e5 + 50;
int t, n, k, ans, a[N];

int read() {
    int x = 0, p = 1;
    char c = getchar();
    for (; !isdigit(c); c = getchar())
        if (c == '-') p = -1;
    for (; isdigit(c); c = getchar())
        x = (x << 3) + (x << 1) + (c & 15);
    return x * p;
}

int write(int x) {
    if (x >= 10) write(x / 10);
    putchar(x % 10 + '0');
}

int writeln(int x) {
    write(x);
    putchar('\n');
}

int main() {
    t = read();
    while (t--) {
        n = read();
        k = read();
        for (int i = 1; i <= n; i++)
            a[i] = read();
        sort(a + 1, a + n + 1);
        a[1] -= k;
        ans = 1;
        for (int i = 2; i <= n; i++) {
            if (a[i] + k < a[i - 1] + 1) a[i] += k;
            else a[i] = max(a[i] - k, a[i - 1] + 1);
            if (a[i] > a[i - 1]) ans++;
        }
        writeln(ans);
    }
    return 0;
}