#include<bits/stdc++.h>
using namespace std;
int t,n,k;
int a[100005];
int main()
{
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d%d",&n,&k);
        for (int i=1;i<=n;++i)
            scanf("%d",&a[i]);
        sort(a+1,a+1+n);
        int p=a[1]-k+1;
        int ans=1;
        for (int i=2;i<=n;++i)
        {
            if (a[i]-k>p)
            {
                ++ans;
                p=a[i]-k+1;
            }
            else
            {
                if (abs(a[i]-p)<=k)
                {
                    ++p;
                    ++ans;
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}