#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<queue>
#include<stack>
#include<algorithm>
#include<unordered_map>
using namespace std;
long long n,k,t,a[100005];
int main()
{
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld%lld",&n,&k);
        int i;
        for(i=0;i<n;i++)
        scanf("%lld",&a[i]);
        sort(a,a+n);
        long long base=-1e9,ans=0;
        for(i=0;i<n;i++)
        {
            if(base<a[i]+k)
            {
                ans++;
                base=max(base+1,a[i]-k);
//                printf("b:%lld\n",base);
            }
        }
        printf("%lld\n",ans);
    }
    return 0;
}