#include <stdio.h>
#include <vector>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#include <iostream>
#include <set>
#include <cstring>
using namespace std;

const int maxv=101000;
const long long mod=998244353;
const int maxNum=0x7fffffff-10;
const double eps=1e-11;
const double PI=3.1415926535;
typedef long long LL;

int a[maxv];
int main(){
    int t,n,k,pos,ans;
    scanf("%d",&t);
    while(t--){
        ans=0;
        scanf("%d %d",&n,&k);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        sort(a+1,a+n+1);
        for(int i=1;i<=n;i++){
            if(i==1) pos=a[i]-k+1,ans++;
            else{
                if(pos<=a[i]+k) ans++,pos=max(pos+1,a[i]-k+1);
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}