#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int N = 5e5 + 5;
int n, m, na[N], nb[N], tot;
ll k;
struct node {
    int data;
    ll sum;
} tree[N * 4 + 50];
void pushup(int id) {
    tree[id].data = tree[id << 1].data + tree[id << 1 | 1].data;
    tree[id].sum = tree[id << 1].sum + tree[id << 1 | 1].sum;
}
// x,y,的cnt个数
int queryxy(int id, int l, int r, int ql, int qr) {
    if (ql <= l && r <= qr) {
        return tree[id].data;
    }
    int mid = (l + r) >> 1;
    if (qr <= mid) {
        return queryxy(id << 1, l, mid, ql, qr);
    } else if (ql > mid) {
        return queryxy(id << 1 | 1, mid + 1, r, ql, qr);
    } else {
        return queryxy(id << 1, l, mid, ql, qr) +
               queryxy(id << 1 | 1, mid + 1, r, ql, qr);
    }
}
// x,y,的sum
ll querysum(int id, int l, int r, int ql, int qr) {
    if (ql <= l && r <= qr) {
        return tree[id].sum;
    }
    int mid = (l + r) >> 1;
    if (qr <= mid) {
        return querysum(id << 1, l, mid, ql, qr);
    } else if (ql > mid) {
        return querysum(id << 1 | 1, mid + 1, r, ql, qr);
    } else {
        return querysum(id << 1, l, mid, ql, qr) +
               querysum(id << 1 | 1, mid + 1, r, ql, qr);
    }
}
void change(int id, int l, int r, int x, int cnt) {
    if (l == r) {
        tree[id].data += cnt;
        tree[id].sum = tree[id].data * nb[l];
        return;
    }
    int mid = (l + r) >> 1;
    if (x <= mid) {
        change(id << 1, l, mid, x, cnt);
    } else {
        change(id << 1 | 1, mid + 1, r, x, cnt);
    }
    pushup(id);
}
// 第cnt个的位置
int querycnt(int id, int l, int r, int cnt) {
    if (l == r) {
        return l;
    }
    int mid = l + r >> 1;
    if (cnt > tree[id << 1].data) {
        return querycnt(id << 1 | 1, mid + 1, r, cnt - tree[id << 1].data);
    } else {
        return querycnt(id << 1, l, mid, cnt);
    }
}

void solve() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> na[i];
        na[i] -= i;
        nb[i] = na[i];
    }
    sort(nb + 1, nb + 1 + n);
    int l = 1, r = n;
    for (int i = 1; i <= n; i++) {
        int pos = upper_bound(nb + 1, nb + 1 + n, nb[i]) - nb;
        l = max(l, pos - i + 1);
    }
    tot = unique(nb + 1, nb + 1 + n) - nb - 1;
    for (int i = 1; i <= n; i++) {
        na[i] = lower_bound(nb + 1, nb + 1 + tot, na[i]) - nb;
    }
    auto ck = [&](int mid) -> bool {
        ll res = 0;
        for (int i = 1; i <= tot * 4; i++) {
            tree[i].data = tree[i].sum = 0;
        }
        for (int i = 1; i < mid; i++) {
            change(1, 1, tot, na[i], 1);
        }
        for (int i = mid; i <= n; i++) {
            change(1, 1, tot, na[i], 1);
            int pos = querycnt(1, 1, tot, (mid + 1) / 2);
            ll su0 = 0, su1 = 0;
            if (pos > 1) {
                su0 = querysum(1, 1, tot, 1, pos - 1);
                int ct0 = queryxy(1, 1, tot, 1, pos - 1);
                su0 = nb[pos] * ct0 - su0;
            }
            su1 = querysum(1, 1, tot, pos, tot);
            int ct0 = queryxy(1, 1, tot, pos, tot);
            su1 = su1 - nb[pos] * ct0;
            if (su0 + su1 <= k) {
                // cout << pos << ' ' << su0 << ' ' << su1;
                return 1;
            }
            change(1, 1, tot, na[i - mid + 1], -1);
        }

        return 0;
    };

    while (l <= r) {
        int mid = l + r >> 1;
        if (ck(mid)) {
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    cout << l - 1 << '\n';
}
int main() {
    std::ios::sync_with_stdio(false);

    std::cin.tie(nullptr);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}