#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,k;
        cin>>n>>k;
        int a[n];
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        sort(a,a+n);
        int ans=0;
        int min_qu=-1e9-5,max_qu=-1e9-5;
        int q=0;
        for(int i=0;i<n;i++)
        {
            if(min_qu==-1e9-5)
            {
                min_qu=a[i]-k;
                max_qu=a[i]+k;
                q++;
            }
            else
            {
                if(max_qu>=(a[i]-k))
                {
                    max_qu=a[i]+k;
                    q++;
                    if(i==n-1)
                    {
                        ans+=min(max_qu-min_qu+1,q);
                    }
                }
                else
                {
                    ans+=min(max_qu-min_qu+1,q);
                    q=1;
                    min_qu=a[i]-k;
                    max_qu=a[i]+k;
                    if(i==n-1)
                    {
                        ans+=min(max_qu-min_qu+1,q);
                    }
                }
            }
            //cout<<min_qu<<" "<<max_qu<<" "<<ans<<endl;
        }
        ans=min(ans,n);
        cout<<ans<<endl;
    } 
    return 0;
}