#include <bits/stdc++.h>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

const int maxn =  + ;

int a[maxn];

int n, T;

LL que[][maxn], head[], tail[];

LL en = 1e14;

bool check(int val) {

    head[] = tail[] = head[] = tail[] = ;

    int res = n % (val - );

    if (res == ) {

        res = val - ;

    }

    LL ans = ;

    if (res == ) {

        for (int i = ; i <= n; ++i) que[][tail[]++] = a[i];

    } else {

        int sum = ;

        for (int i = ; i <= res; ++i) sum += a[i];

        for (int i = res + ; i <= n; ++i) que[][tail[]++] = a[i];

        ans = sum;

        que[][tail[]++] = sum;

    }

    while (true) {

        if (ans > T) return false;

        LL sum = ;

        int want = val;

        while (want--) {

            LL mi1 = 1e14, mi2 = 1e14;

            if (head[] < tail[]) mi1 = que[][head[]];

            if (head[] < tail[]) mi2 = que[][head[]];

            if (mi1 < mi2) sum += mi1, head[]++;

            else sum += mi2, head[]++;

            if (mi1 == en && mi2 == en) return true; // 不可以取了

        }

        que[][tail[]++] = sum;

        ans += sum;

    }

    return true;

}

void work() {

    scanf("%d%d", &n, &T);

    for (int i = ; i <= n; ++i) scanf("%d", a + i);

    sort(a + , a +  + n);

    int be = , en = n;

//    cout << check(2) << endl;

    while (be <= en) {

        int mid = (be + en) >> ;

        if (check(mid)) en = mid - ;

        else be = mid + ;

    }

    printf("%d\n", be);

}

int main() {

#ifdef local

    freopen("data.txt", "r", stdin);

//    freopen("data.txt", "w", stdout);

#endif

    int t;

    scanf("%d", &t);

    while (t--) work();

    return ;

}