#include <bits/stdc++.h> using namespace std; int a[100005]; void solve() { deque<int> dq; int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; } sort(a+1, a+n+1); int maxn = -1e9; for (int i = 1; i <= n; i++) { dq.push_back(a[i]); if ((dq.size() >= 2) && (1 < (dq[dq.size()-1]-dq[dq.size()-2]))) dq.empty(); while (k < (dq[dq.size()-1]-dq[0])) { dq.pop_front(); } // cout << dq.size() << endl; maxn=max(maxn, int(dq.size())); } cout << maxn << endl; } int main() { int t; cin >> t; while (t--) { solve(); } return 0; }