#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
#define ll long long

const int maxn=1e5+10;

int a[maxn];

int main()
{
    int t,n,i,j,siz,value,g;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d%d",&n,&siz);
        for (i=1;i<=n;i++)
            scanf("%d",&a[i]);
        sort(a+1,a+n+1);

        value=-2e9+10;

        g=0;
        //下一次要大于等于value
        for (i=1;i<=n;i++)
        {
            if (value<a[i]-siz)
            {
                g++;
                value=a[i]-siz+1;
            }
            else
            {
//                if (a[i]-k)

                if (value<=a[i]+siz)
                {
                    g++;
                    value++;
                }

            }
        }
        printf("%d\n",g);
    }


    return 0;
}