#include <bits/stdc++.h>
using namespace std;
 
#define int long long
void solve(){
	int n,k;
	cin>>n>>k;
	vector<int> v(n);
	for(int i=0;i<n;i++){
		cin>>v[i];
	}
	sort(v.begin(),v.end());
	int ans=0;
	for(int i=0;i<n-1;i++){
		if((v[i+1]-v[i])>k){
			int t=(i+1-ans);
			if((t)>(n-i-1)){
				ans+=(n-i-1);
				break;
			}
			ans+=t;
		}
	}
	cout<<ans<<endl;
}
signed main() {
	// your code goes here
	int t;
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGludCBsb25nIGxvbmcKdm9pZCBzb2x2ZSgpewoJaW50IG4sazsKCWNpbj4+bj4+azsKCXZlY3RvcjxpbnQ+IHYobik7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PnZbaV07Cgl9Cglzb3J0KHYuYmVnaW4oKSx2LmVuZCgpKTsKCWludCBhbnM9MDsKCWZvcihpbnQgaT0wO2k8bi0xO2krKyl7CgkJaWYoKHZbaSsxXS12W2ldKT5rKXsKCQkJaW50IHQ9KGkrMS1hbnMpOwoJCQlpZigodCk+KG4taS0xKSl7CgkJCQlhbnMrPShuLWktMSk7CgkJCQlicmVhazsKCQkJfQoJCQlhbnMrPXQ7CgkJfQoJfQoJY291dDw8YW5zPDxlbmRsOwp9CnNpZ25lZCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IHQ7CgljaW4+PnQ7Cgl3aGlsZSh0LS0pewoJCXNvbHZlKCk7Cgl9CglyZXR1cm4gMDsKfQ==

Nwo1IDEKMSAyIDQgNSA2CjEgMgoxMAo4IDMKMTcgMyAxIDIwIDEyIDUgMTcgMTIKNCAyCjIgNCA2IDgKNSAzCjIgMyAxOSAxMCA4CjMgNAoxIDEwIDUKOCAxCjggMyAxIDQgNSAxMCA3IDMK

7
5 1
1 2 4 5 6
1 2
10
8 3
17 3 1 20 12 5 17 12
4 2
2 4 6 8
5 3
2 3 19 10 8
3 4
1 10 5
8 1
8 3 1 4 5 10 7 3