#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int maxn = 3e5 + 70;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
const double eps = 1e-7;
const double PI = acos(-1.0);

int n, m, k;

int a[maxn];

int main(){
    //freopen("in.txt", "r", stdin);
    int T; cin >> T;
    while(T--){
        scanf("%d %d",&n,&k);
        for(int i=0;i<n;i++) scanf("%d",&a[i]);
        sort(a,a+n);

        int ans = 0, x = a[0] - k;
        for(int i=0;i<n;i++){
            if(x < a[i] - k) x = a[i] - k;
            if(x <= a[i] + k) ans++, x++;
        }
        printf("%d\n", ans);
    }
    return 0;
}