# include <bits/stdc++.h>
using namespace std;
# define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
# define int long long
# define lowbit(x) (x & (-x))
# define fi first
# define se second
# define all(x) x.begin(), x.end()

// # define endl '\n'

inline int Read();

typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
const int N = 1e6 + 10;

vector <int> v;

int a[N];
int n, m;
int ok(int x){
    map <int, int> mp;
    priority_queue<int, vector <int>, less <int>> q;// 大根堆 存小值
    priority_queue<int, vector <int>, greater <int>> p;// 小根堆 存大值
    if(x == 1) return 1;
    int k = (x + 1) / 2;
    int sum1 = 0, sum2 = 0;
    int num1 = 0, num2 = 0;
    for(int i = 1; i <= n; i ++){
        mp[a[i]] ++;
        if(num1 < k){
            sum1 += a[i];
            num1 += 1;
            q.push(a[i]);
        }else{
            if(a[i] > q.top()){
                sum2 += a[i];
                num2 += 1;
                p.push(a[i]);
            }else{
                q.push(a[i]);
                while(q.size()){
                    if(mp[q.top()] == 0) continue;
                    int u = q.top();
                    q.pop();
                    sum1 -= u;
                    sum1 += a[i];
                    sum2 += u;
                    num2 ++;
                    p.push(u);
                    break;
                }
                
            }
        }
        if(i > x){
            int t = a[i - x];
            // cout << t <<" " << q.top() <<"**********\n";
            mp[t] --;
            if(t <= q.top()){
                num1 --;
                sum1 -= t;
            }else{
                num2 --;
                sum2 -= t;
                // cout << i <<"*********\n";
            }
            while(q.size() && mp[q.top()] == 0) q.pop();
            while(p.size() && mp[p.top()] == 0) p.pop();
            while(num1 < k){
                while(p.size()){
                    int u = p.top();
                    p.pop();
                    if(mp[u] == 0) continue;
                    else{
                        q.push(u);
                        num1 ++;
                        sum1 += u;
                        sum2 -= u;
                        num2 --;
                        break;
                    }
                }
            }
        }
        // cout << i <<" " << sum1 <<" " << sum2 <<"\n";
        if(i >= x){
            int t = q.top();
            // cout << t <<"**";
            // cout << t * num1 - sum1 + sum2 - t * num2 <<" ";
            // cout << num1 <<" " << num2 <<"**\n";
            if(t * num1 - sum1 + sum2 - t * num2 <= m) return 1;
        }
    }
    return 0;
}
void Solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; i ++){
        cin >> a[i];
        a[i] -= i;
    }
    int l = 1, r = n, mid;
    while(l < r){
        mid = l + r + 1 >> 1;
        if(ok(mid)) l = mid;
        else r = mid - 1;
    }
    cout << l <<"\n";
    // ok(3);

}
signed main(){
    IOS;
    int T = 1;
    cin >> T;
    while (T--) 
        Solve();
    return 0;
}
inline int Read(){
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9'){ if (c == '-') f = -1; c = getchar();}
    while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}