#include <stdio.h>
#include <algorithm>

using namespace std;

int n , k;
int a[120000];
int ans;
void work () {
    int i , t;
    scanf ( "%d%d" , &n , &k );
    for ( i = 1 ; i <= n ; i++ ) {
        scanf ( "%d" , &a[i] );
    }
    sort ( a + 1 , a + 1 + n );
    ans = 0;
    for ( i = 1 ; i <= n ; i++ ) {
        t = a[i] + k;
        a[i] -= k;
        if ( i != 1 ) {
            a[i] = max ( a[i-1] + 1 , a[i] );
        }
        if ( a[i] > t ) a[i] = t;
    }
    for ( i = 1 ; i <= n ; i++ ) {
        if ( i == 1 || a[i] != a[i-1] ) {
            ans++;
        }
    }
    printf ( "%d\n" , ans );
}
int main () {
    int t;
    scanf ( "%d" , &t );
    while ( t-- ) {
        work ();
    }
    return 0;
}