#include<bits/stdc++.h>

using namespace std;

int main() {
    
    int t;
    cin >> t;
    while(t--){
        
        long long n,k;
        cin >> n >> k;
        
        long long a[100005] = {0};
        long long b[100005] = {0};
        map<int,int> m;
        for(int i = 1;i <= n;i++){
            scanf("%lld",&a[i]);
        }
        int cnt = 0;
        sort(a+1,a+n+1);
        b[0] = a[1] - k - 1;
        for(int i = 1;i <= n;i++){
            if(a[i] == a[i-1]){
                if(abs(b[i-1] + 1 - a[i]) <= k){
                    b[i] = b[i-1] + 1;
                    m[b[i]]++;
                    cnt++;
                }else{
                    b[i] = b[i-1];
                }
            }else{
                if(abs(b[i-1] + 1 - a[i]) <= k){
                    b[i] = b[i-1] + 1;
                    m[b[i]]++;
                    cnt++;
                }else{
                    b[i] = a[i] - k;
                    m[b[i]]++;
                    cnt++;
                }
                
            }
        }
        
        
        cout << cnt << endl;
        
        
    }
    
    
    
    
    
    return 0;
}