#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=1,c=1;
for(int i=0;i<n-1;i++){
if((v[i+1]-v[i])>k){
c=1;
}
else{
c++;
}
ans=max(c,ans);
}
cout<<n-ans<<endl;
}
signed main() {
// your code goes here
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGludCBsb25nIGxvbmcKdm9pZCBzb2x2ZSgpewoJaW50IG4sazsKCWNpbj4+bj4+azsKCXZlY3RvcjxpbnQ+IHYobik7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PnZbaV07Cgl9Cglzb3J0KHYuYmVnaW4oKSx2LmVuZCgpKTsKCWludCBhbnM9MSxjPTE7Cglmb3IoaW50IGk9MDtpPG4tMTtpKyspewoJCWlmKCh2W2krMV0tdltpXSk+ayl7CgkJCWM9MTsKCQl9CgkJZWxzZXsKCQkJYysrOwoJCX0KCQlhbnM9bWF4KGMsYW5zKTsKCX0KCWNvdXQ8PG4tYW5zPDxlbmRsOwp9CnNpZ25lZCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IHQ7CgljaW4+PnQ7Cgl3aGlsZSh0LS0pewoJCXNvbHZlKCk7Cgl9CglyZXR1cm4gMDsKfQ==