#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=100005;
int main()
{

    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,k,arr[N],minn,cnt=1;
        scanf("%d%d",&n,&k);
        for(int i=0; i<n; i++)
        {
            scanf("%d",&arr[i]);
        }
        sort(arr,arr+n);
        minn=arr[0]-k;
        for(int i=1; i<n; i++)
        {
            if(arr[i]==arr[i-1])
            {
                minn++;
                if(minn<=arr[i]+k)
                    cnt++;
                else minn--;
            }
            else
            {
                if(minn>=arr[i]-k)
                {
                    minn++;
                    if(minn<=arr[i]+k)
                        cnt++;
                }
                else
                {
                    minn=arr[i]-k;
                    cnt++;
                }
            }
        }
        printf("%d\n",cnt);
    }
    return 0;
}