#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int consistency(int n, int S){

    int total = a[0];
    vector<int> b(n-1);
    for(int i=0; i<n-1; i++){
        b[i] = a[i+1];
        total += a[i+1];
    }
    int m = n-1;
    sort(begin(b), end(b));

    int ct = 0;

    int leftSum = 0;
    int rightSum = 0;

    for(int i=0; i<m; i++){
        leftSum += b[i];
        rightSum += b[m-1-i];

        int minX = min(leftSum, rightSum);

        
        int cost = minX * (total - minX);
        if(cost <= S){
            ct = i+1;
        }
    }

    return n-ct;
}















int practice(int n, int S){


    return 0;
}





void solve() {
    
    int n, S;
    cin>> n >> S;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n, S) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}