#include <bits/stdc++.h> #define int long long using namespace std; int t,n,k,a[100005]; signed main () { cin >> t; while (t--) { memset(a,0,sizeof(a)); cin >> n >> k; for (int i = 1;i <= n;i++) { cin >> a[i]; } sort(a + 1,a + n + 1); int l = 1,r = 1,ans = 0; while (r <= n) { if (a[r] - a[r - 1] > 1) { l = r; } else { while (a[r] - a[l] > k) { l++; } } ans = max(ans,r - l + 1); r++; } cout << ans << endl; } return 0; }