#include<bits/stdc++.h> using namespace std; int a[100005]; map<int ,int>mp; int n,k,T; int main(){ //freopen("clamprun.in","r",stdin); //freopen("clamprun.out","w",stdout); scanf("%d",&T); while(T--){ scanf("%d%d",&n,&k); k++; mp.clear(); for(int i = 1;i<=n;i++)scanf("%d",&a[i]); for(int i = 1;i<=n;i++)mp[a[i]]++; sort(a+1,a+n+1); n=unique(a+1,a+n+1)-a-1; int con = 0,cnt =0,maxx =0,lst=0; for(int i = 1;i<=n;i++){ if(a[i-1]!=a[i]-1||i==1){ con=1,cnt=mp[a[i]]; lst=mp[a[i]]; maxx=max(cnt,maxx); continue; } con++; cnt+=mp[a[i]]; if(con>k){ cnt-=lst; lst=mp[a[i-k+1]]; } maxx=max(cnt,maxx); } printf("%d\n",maxx); } }