#include<iostream>
#include<algorithm>
using namespace std;

int a[100005],b[100005];

int main()
{
    int t,n,k;
    cin>>t;
    while(t--)
    {
        cin>>n>>k;
        for(int i=0;i<n;i++)
            cin>>a[i];
        sort(a,a+n);
        int x=a[0]-k,count=0;
        for(int i=0;i<n;i++)
        {
            if(x<a[i]-k)
            {
                x=a[i]-k+1;
                count++;
            }
            else if(x<=a[i]+k)
            {
                count++;
                x++;
            }
        }
        cout<<count<<endl;
    }
    return 0;
}