//Δ_2
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 111111;
int n,k,a[N];
int main()
{
    int T,i,x,s;
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&k);
        for(i=1;i<=n;i++)
            scanf("%d",a+i);
        sort(a+1,a+n+1);
        s=1;
        x=a[1]-k;
        for(i=2;i<=n;i++){
            if(a[i]==a[i-1]){
                if(x-a[i]==k)
                    ;
                else
                    x++,s++;
            }
            else
                x=max(a[i]-k,x+1),s++;
        }
        printf("%d\n",s);
    }
    return 0;
}