#include "bits/stdc++.h"
using namespace std;
const int Len = 5e5 + 5;
inline int read()
{
	int x = 0 , f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9')
	{
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while('0' <= ch && ch <= '9')
	{
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar();
	}
	return x * f;
}
void write(int x)
{
	if(x < 0){putchar('-');x = -x;}
	if(x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
inline void writeN(int x){write(x) , putchar('\n');}
#define ll long long
int n,m,tot,rt,x,y,z,a[Len];
struct FHQ
{
	int l,r,ff,ky,val,sz;
	ll sum;
	FHQ(){l = r = ff = ky = val = sz = sum = 0;}
	FHQ(int L,int R,int FF,int KY,int VAL,int SZ,ll SUM){l = L , r = R , ff = FF , ky = KY , val = VAL , sz = SZ , sum = SUM;}
}fhq[Len];
#define ls(p) fhq[p].l
#define rs(p) fhq[p].r
inline void push_up(int p){fhq[p].sz = fhq[ls(p)].sz + fhq[rs(p)].sz + 1;fhq[p].sum = fhq[ls(p)].sum + fhq[rs(p)].sum + fhq[p].val;}
inline int clone(int v)
{
	tot ++;
	fhq[tot] = FHQ(0 , 0 , 0 , rand() , v , 1 , v);
	return tot;
}
void split(int now,int v,int &x,int &y,int lstx,int lsty)
{
	if(!now){x = y = 0;return;}
	if(fhq[now].val <= v)
	{
		x = now;
		fhq[x].ff = lstx;
		split(rs(now) , v , rs(now) , y , x , lsty);
	}
	else
	{
		y = now;
		fhq[y].ff = lsty;
		split(ls(now) , v , x , ls(now) , lstx , y);
	}
	push_up(now);
}
int merge(int x,int y)
{
	if(!x || !y) return x + y;
	if(fhq[x].ky < fhq[y].ky)
	{
		rs(x) = merge(rs(x) , y);
		fhq[rs(x)].ff = x;
		push_up(x);
		return x;
	}
	else 
	{
		ls(y) = merge(x , ls(y));
		fhq[ls(y)].ff = y;
		push_up(y);
		return y;
	}
}
inline void ins(int v)
{
	//printf("wowenwen%d\n",v);
	split(rt , v - 1 , rt , x , 0 , 0);
	rt = merge(rt , clone(v));
	rt = merge(rt , x);
}
inline void del(int v)
{
	split(rt , v - 1 , x , y , 0 , 0);
	split(y , v , y , z , 0 , 0);
	y = merge(ls(y) , rs(y));
	y = merge(y , z);
	rt = merge(x , y);
}
inline void quRak(int v)
{
	split(rt , v - 1 , x , y , 0 , 0);
	writeN(fhq[x].sz + 1);
	rt = merge(x , y);	
}
inline int Prknum(int rk)
{
	int u = rt;
	if(fhq[u].sz < rk) return -1;
	while(u)
	{
		int lsize = fhq[ls(u)].sz;
		if(lsize + 1 == rk) return fhq[u].val;
		else if(lsize + 1 > rk) u = ls(u);
		else rk -= lsize + 1 , u = rs(u);
	}
	return -1;
}
inline void clr()
{
	for(int i = 1 ; i <= tot ; i ++) fhq[i] = FHQ(0 , 0 , 0 , 0 , 0 , 0 , 0);
	tot = rt = x = y = z = 0;
}
ll k;
inline int check(int len)
{
	if(len <= 1) return 1;
	const int qrk = len / 2 + (len % 2);
	int ql = 0 , nv = 0;ll sm = 0;
	nv = Prknum(qrk);
	split(rt , nv , x , y , 0 , 0);
	sm = 1ll * nv * fhq[x].sz - fhq[x].sum + fhq[y].sum - 1ll * nv * fhq[y].sz;
	rt = merge(x , y);
	//printf("%d %d %d %d %lld\n",nv,fhq[rt].sz,len,qrk,sm);
	ql |= (sm <= k);
	return ql;
}
signed main()
{
	srand(time(0));
	int T = read();
	while(T --)
	{
		clr();
		n = read() , k = read();
		for(int i = 1 ; i <= n ; i ++) a[i] = read() - i;
		//for(int i = 1 ; i <= n ; i ++) printf("%d ",a[i]);puts("");
		int l = 1 , r = 0 , anss = 0;
		while(l <= n)
		{
			while(1)
			{
				if(r + 1 <= n)
				{
					r ++;
					ins(a[r]);
					if(check(r - l + 1)) 
					{
						anss = max(anss , r - l + 1);
						continue;
					}
					del(a[r]);
					r --;
					break;
				}
				else break;
			}
			del(a[l ++]);
		}
		writeN(anss);
	}
	return 0;
}