#include<iostream>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll maxn = 5e5 + 10;
struct s
{
	ll l, r;
	ll cs;
}p[maxn << 2];
ll fa[maxn << 2];
void build(ll i, ll l, ll r)
{
	p[i].l = l; p[i].r = r;
	p[i].cs = 0;
	if (l == r)
	{
		//cout<<99<<endl;
		fa[l] = i;
		return;
	}
	build(i << 1, l, (l + r) >> 1);
	build(i << 1 | 1, (l + r >> 1) + 1, r);
}
void upd(ll i, ll x)
{
	if (p[i].l == p[i].r)
	{
		p[i].cs++;
		//cout<<p[i].cs<<endl;
		return;
	}
	ll mid = (p[i].l + p[i].r) >> 1;
	ll i1 = i << 1;
	ll i2 = i << 1 | 1;
	if (x <= mid)
		upd(i1, x);
	if (x >= mid + 1)
		upd(i2, x);
	p[i].cs = p[i1].cs + p[i2].cs;
	//cout<<p[i].cs<<endl;
}
void dt(ll i, ll x)
{
	if (p[i].l == p[i].r)
	{
		p[i].cs--;
		//cout<<p[i].cs<<endl;
		return;
	}
	ll mid = (p[i].l + p[i].r) >> 1;
	ll i1 = i << 1;
	ll i2 = i << 1 | 1;
	if (x <= mid)
		dt(i1, x);
	if (x >= mid + 1)
		dt(i2, x);
	p[i].cs = p[i1].cs + p[i2].cs;
}
ll query(ll i, ll l, ll r)
{
	ll ans = 0;
	if (l == p[i].l && p[i].r == r)
	{
		ans += p[i].cs;
		return ans;
	}
	ll i1 = i << 1;
	ll i2 = i << 1 | 1;
	if (l <= p[i1].r)
	{
		if (r <= p[i1].r)
		{
			ans += query(i1, l, r);
		}
		else
			ans += query(i1, l, p[i1].r);
	}
	if (r >= p[i2].l)
	{
		if (l >= p[i2].l)
			ans += query(i2, l, r);
		else
			ans += query(i2, p[i2].l, r);
	}
	return ans;
}
ll sa(ll i, ll k, ll l, ll r)
{
	if (l == r)
	{
		return l;
	}
	ll ans = 0;
	ll i1 = i << 1, i2 = i << 1 | 1;
	if (k <= p[i1].cs)
	{
		ans = sa(i1, k, l, p[i1].r);
	}
	else
		ans = sa(i2, k - p[i1].cs, p[i2].l, r);
	return ans;
}
ll a[500005];
ll b[500005];
map<ll, ll>q;
set<ll>f;
int main()
{
	ll t;
	cin >> t;
	while (t--)
	{
		q.clear();
		f.clear();
		ll n, m;
		cin >> n >> m;
		for (ll i = 1; i <= n; i++)
		{
			cin >> a[i];
			a[i] -= i;
			f.insert(a[i]);
		}
		ll cnt = 0;
		for (auto j : f)
		{
			cnt++;
			q[j] = cnt;
			b[cnt] = j;
		}
		deque<ll>co;
		build(1, 1, cnt);
		ll sz = 0;
		ll ans = 0;
		ll op;
		ll an = 1;
		for (ll i = 1; i <= n; i++)
		{
			if (co.empty())
			{
				co.push_back(a[i]);
				upd(1, q[a[i]]);
				sz++;
				op = b[sa(1, (sz + 1) / 2, 1, cnt)];
				ans = 0;
			}
			else
			{
				co.push_back(a[i]);
				ans += abs(a[i] - op);
				upd(1, q[a[i]]);
				sz++;
				ll mid = b[sa(1, (sz + 1) / 2, 1, cnt)];
				if (mid > op)
				{
					ans += ((sz - 1) / 2) * abs(op - mid);
					ans -= (sz - ((sz - 1) / 2)) * abs(op - mid);
				}
				else if (mid < op)
				{
					ans -= ((sz + 1) / 2) * abs(op - mid);
					ans += (sz - (sz + 1) / 2) * abs(op - mid);
				}
				while (!co.empty() && ans > m)
				{
					ans -= abs(co.front() - mid);
					dt(1, q[(ll)co.front()]);
					sz--;
					mid = b[sa(1, (sz + 1) / 2, 1, cnt)];
					if (mid > op)
					{
						ans -= ((sz + 1) / 2) * abs(op - mid);
						ans += (sz - (sz + 1) / 2) * abs(op - mid);
					}
					op = mid;
					co.pop_front();
				}
				an = max(an, (ll)co.size());
				op = mid;
				//co.pop_front();
			}
		}
		cout << an << endl;
	}
}