#include <iostream>
#include<bits/stdc++.h>
typedef long long int ll;
 
using namespace std;
 
int main() {
	ll t;
	cin>>t;
	while(t--){
		ll n;
		cin>>n;
		ll cost;
		cin>>cost;
 
 
		ll sum=0;
 
		vector<ll> arr(n+1);
		for(int i=1;i<=n;i++){
			cin>>arr[i];
			sum = sum + arr[i];
 
 
		}
 
 
		int nodes = 0;
 
 
		sort(arr.begin()+2,arr.end());
		for(int i=1;i<=n-1;i++){
 
			ll sum2=0;
			for(int j = 2 ; j<2+i ; j++){
				sum2 = sum2 + arr[j];
			}
 
			ll sum3=0;
 
			for(int j = n ; j>=n-i+1 ; j--){
				sum3 = sum3 + arr[j];
			}
 
			ll left = sum2*(sum-sum2);
			ll right = sum3*(sum-sum3);
 
			ll answer = min(left,right);
 
			if(answer<=cost){
				nodes = i;
 
			}
 
		}
 
		cout<<n-nodes<<endl;
 
 
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgp0eXBlZGVmIGxvbmcgbG9uZyBpbnQgbGw7Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglsbCB0OwoJY2luPj50OwoJd2hpbGUodC0tKXsKCQlsbCBuOwoJCWNpbj4+bjsKCQlsbCBjb3N0OwoJCWNpbj4+Y29zdDsKCQkKCQkKCQlsbCBzdW09MDsKCQkKCQl2ZWN0b3I8bGw+IGFycihuKzEpOwoJCWZvcihpbnQgaT0xO2k8PW47aSsrKXsKCQkJY2luPj5hcnJbaV07CgkJCXN1bSA9IHN1bSArIGFycltpXTsKCQkJCgkJCQoJCX0KCQkKCQkKCQlpbnQgbm9kZXMgPSAwOwoJCQoJCQoJCXNvcnQoYXJyLmJlZ2luKCkrMixhcnIuZW5kKCkpOwoJCWZvcihpbnQgaT0xO2k8PW4tMTtpKyspewoJCQkKCQkJbGwgc3VtMj0wOwoJCQlmb3IoaW50IGogPSAyIDsgajwyK2kgOyBqKyspewoJCQkJc3VtMiA9IHN1bTIgKyBhcnJbal07CgkJCX0KCQkJCgkJCWxsIHN1bTM9MDsKCQkJCgkJCWZvcihpbnQgaiA9IG4gOyBqPj1uLWkrMSA7IGotLSl7CgkJCQlzdW0zID0gc3VtMyArIGFycltqXTsKCQkJfQoJCQkKCQkJbGwgbGVmdCA9IHN1bTIqKHN1bS1zdW0yKTsKCQkJbGwgcmlnaHQgPSBzdW0zKihzdW0tc3VtMyk7CgkJCQoJCQlsbCBhbnN3ZXIgPSBtaW4obGVmdCxyaWdodCk7CgkJCQoJCQlpZihhbnN3ZXI8PWNvc3QpewoJCQkJbm9kZXMgPSBpOwoJCQkJCgkJCX0KCQkJCgkJfQoJCQoJCWNvdXQ8PG4tbm9kZXM8PGVuZGw7CgkKCQkKCX0KCXJldHVybiAwOwp9

NAozIDEwMDAwMDAwMDAwMDAwMDAwMDAKMjAwMDAwMCA0MDAwMDAwIDUwMDAwMDAKNCAxNTAKMTAwIDEgMSAxCjYgMTI3NQozNSAxNSAxMCAyNSAxMCA1CjYgNDAwCjM1IDE1IDEwIDI1IDEwIDU=

4
3 1000000000000000000
2000000 4000000 5000000
4 150
100 1 1 1
6 1275
35 15 10 25 10 5
6 400
35 15 10 25 10 5