#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))
const int N = 5e5 + 4;
int a[N];
int main() {
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,k;
        int ans=0;
        scanf("%d%d",&n,&k);
        for(int i=0;i<n;i++)scanf("%d",&a[i]);
        sort(a,a+n);
        int l=a[0]-k;
        ans++;
        for(int i=1;i<n;i++)
        {
            if(a[i]==a[i-1])
            {
                if(l==a[i]+k)continue;
                else l++,ans++;
            }
            else 
            {
                if(l<a[i]-k)l=a[i]-k-1;
                l++;
                ans++;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}