#include <iostream>
#include <cstring>
#include <algorithm>
#include<map>
using namespace std;
const int N = 100010;
typedef long long LL;

LL n,m,k;
LL a[N];
LL x;
int main()
{
        std::ios::sync_with_stdio(false);std::cin.tie(NULL);/*等价于cin.tie(0);*/
    cin>>m;
    while (m -- )
    {
        x=0;
        cin>>n>>k;
        // map<int,int > mp;
        for(int i=1;i<=n;i++)cin>>a[i];
        sort(a+1,a+n+1);
        LL pre=-0x3f3f3f3f;
        for(int i=1;i<=n;i++)
        {
            LL j=a[i];
            if(pre<j-k)
            {
                x++;
                pre=j-k;
            }
            else
            {
                LL y=pre+1;
                if(y<=j+k)
                {
                    pre=y;
                    x++;
                }
            }
            // cout<<pre<<" ";
            
        }
        // cout<<endl;
        cout<<x<<endl;
    }
}