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

int n, a[100010], k;
int b[100010];

void work()
{
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    sort(a + 1, a + 1 + n);
    int ans = 1;
    b[1] = a[1] - k;
    for (int i = 2; i <= n; i++)
    {
        b[i] = b[i - 1] + 1;
        if (b[i] - k > a[i]) b[i] = a[i] + k;
        else
        {
            ans++;
            if (b[i] + k < a[i]) b[i] = a[i] - k;
        }
    }
    printf("%d\n", ans);
}


int main()
{
    int t; scanf("%d", &t);
    while (t--) work();
    return 0;
}