//音乐是苍白的鬼魂，就像玫瑰是疯狂而必死的美：她苍白而必死
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
#define vec vector
#define pb push_back
#define PDD pair<double,double>
#define PLL pair<ll,ll>
#define PII pair<int,int>
#define INF 0x3f3f3f3f
#define i128 __int128
#define ld long double
#define pi 3.1415926535
//const ll mod=1e9+7;
const ll mod=998244353;
bool isprime(ll x){
    if(x==1)return false;
    for(ll i=2;i<=x/i;i++){
        if(x%i==0)return false;
    }
    return true;
}
ll popcnt(ll x){
    ll cnt=0;
    while(x){
        if(x&1)cnt++;
        x>>=1;
    }
    return cnt;
}
ll qmi(ll a,ll b,ll p){
    if(a==0)return 1;
    a%=p;
    ll res=1;
    while(b){
        if(b&1)res=res*a%p;
        a=a*a%p;
        b>>=1;
    }
    return res;
}
ll exgcd(ll a,ll b,ll &x,ll &y){
    if(!b){
        x=1,y=0;
        return a;
    }
    ll d=exgcd(b,a%b,y,x);
    y-=a/b*x;
    return d;
}
ll lowbit(ll x){return x&-x;}
const int N=1e6+10;
ll fact[N],infact[N];
ll C(ll n,ll m) {
    if (n < m || m < 0)return 0;
    return fact[n] * qmi(fact[m] * fact[n - m] % mod, mod - 2, mod) % mod;
}
//ll C(ll n,ll m){
//    if (n < m || m < 0)return 0;
//    return fact[n]%mod*infact[m]%mod*infact[n-m]%mod;
//}
//void scan(__int128 &x)
//{
//    x=0;int f=1;char ch=getchar();
//    while (!isdigit(ch)){if (ch=='-')f=-1;ch=getchar();}
//    while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
//    x*=f;
//}
//inline void print(__int128 x) {
//    if (x < 0) {
//        putchar('-');
//        x = -x;
//    }
//    if (x > 9) print(x / 10);
//}
//--------------------------------------------
ll n,k;
int a[N];
bool check(int x){
    if(x==1)return 1;
    ll sum1=0,sum2=0;
    priority_queue<int>q1;
    priority_queue<int,vec<int>,greater<int>>q2;
    for(int i=1;i<=x;i++){
        if(q1.empty()||q1.top()>=a[i])q1.push(a[i]),sum1+=a[i];
        else q2.push(a[i]),sum2+=a[i];
        if(q1.size()>q2.size()+1)sum1-=q1.top(),sum2+=q1.top(),q2.push(q1.top()),q1.pop();
        if(q2.size()>q1.size())sum2-=q2.top(),sum1+=q2.top(),q1.push(q2.top()),q2.pop();
    }
    ll ans,t1=0,t2=0;
    if(x&1){
        ll mid=q1.top();
        ans=sum2-sum1+mid;
    }
    else ans=sum2-sum1;
    map<ll,ll>mp;
    for(int i=x+1;i<=n;i++){
        if(a[i-x]==q1.top())sum1-=a[i-x],q1.pop();
        else if(a[i-x]==q2.top())sum2-=a[i-x],q2.pop();
        else if(a[i-x]<q1.top())sum1-=a[i-x],t1++,mp[a[i-x]]++;
        else sum2-=a[i-x],t2++,mp[a[i-x]]++;
        if(q1.empty()||q1.top()>=a[i])q1.push(a[i]),sum1+=a[i];
        else q2.push(a[i]),sum2+=a[i];
        if(q1.size()-t1>q2.size()+1-t2)sum1-=q1.top(),sum2+=q1.top(),q2.push(q1.top()),q1.pop();
        if(q2.size()-t2>q1.size()-t1)sum2-=q2.top(),sum1+=q2.top(),q1.push(q2.top()),q2.pop();
        while(mp[q1.top()])mp[q1.top()]--,t1--,q1.pop();
        while(mp[q2.top()])mp[q2.top()]--,t2--,q2.pop();
        if(x&1){
            ll mid=q1.top();
            ans=min(ans,abs(sum2-sum1+mid));
        }
        else ans=min(ans,abs(sum2-sum1));
    }
    return ans<=k;
}
void solve(){
    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i],a[i]-=(i-1);
    int l=1,r=n;
    while(l<r){
        int mid=(l+r+1)>>1;
        if(check(mid))l=mid;
        else r=mid-1;
    }
    cout<<l<<endl;
}
int main() {
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T = 1;
    cin>>T;
    while (T--)solve();
    return 0;
}