#include <bits/stdc++.h>
using namespace std;
// Speed
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
// Typedefs
#define int long long
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define endl '\n'
#define yes cout << "yes\n"
#define no cout << "no\n"
// Loops
#define rep(i,a,b) for(int i=a;i<b;++i)
#define per(i,a,b) for(int i=b-1;i>=a;--i)
#define each(x, a) for (auto& x : a)
// Consts
const int INF = 1e18;
const int MOD = 1e9+7;
const int N = 2e5 + 5;
// Math
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
int power(int a, int b, int m = MOD) {
int res = 1;
while (b > 0) {
if (b & 1) res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
int modinv(int a, int m = MOD) {
return power(a, m - 2, m);
}
// Logic
void solve() {
int n, c;
cin >> n >> c;
int a[n];
rep(i, 0, n) cin >> a[i];
sort(a, a + n);
int ans = INF;
rep(i, 0, n + 1) {
int cost = 0;
rep(j, 0, n) {
int w = a[j];
int mul = max(0LL, j - (n - i));
if (mul >= 60) w = INF;
else w <<= mul;
if (w > c) cost++;
}
ans = min(ans, cost);
}
cout << ans << endl;
}
// Main
int32_t main() {
fast_io;
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgovLyBTcGVlZAojZGVmaW5lIGZhc3RfaW8gaW9zOjpzeW5jX3dpdGhfc3RkaW8oMCk7IGNpbi50aWUoMCk7IGNvdXQudGllKDApCgovLyBUeXBlZGVmcwojZGVmaW5lIGludCBsb25nIGxvbmcKI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSBmZiBmaXJzdAojZGVmaW5lIHNzIHNlY29uZAojZGVmaW5lIGFsbCh4KSAoeCkuYmVnaW4oKSwgKHgpLmVuZCgpCiNkZWZpbmUgcmFsbCh4KSAoeCkucmJlZ2luKCksICh4KS5yZW5kKCkKI2RlZmluZSBzeih4KSAoKGludCkoeCkuc2l6ZSgpKQojZGVmaW5lIGVuZGwgJ1xuJwojZGVmaW5lIHllcyBjb3V0IDw8ICJ5ZXNcbiIKI2RlZmluZSBubyBjb3V0IDw8ICJub1xuIgoKLy8gTG9vcHMKI2RlZmluZSByZXAoaSxhLGIpIGZvcihpbnQgaT1hO2k8YjsrK2kpCiNkZWZpbmUgcGVyKGksYSxiKSBmb3IoaW50IGk9Yi0xO2k+PWE7LS1pKQojZGVmaW5lIGVhY2goeCwgYSkgZm9yIChhdXRvJiB4IDogYSkKCi8vIENvbnN0cwpjb25zdCBpbnQgSU5GID0gMWUxODsKY29uc3QgaW50IE1PRCA9IDFlOSs3Owpjb25zdCBpbnQgTiA9IDJlNSArIDU7CgovLyBNYXRoCmludCBnY2QoaW50IGEsIGludCBiKSB7IHJldHVybiBiID09IDAgPyBhIDogZ2NkKGIsIGEgJSBiKTsgfQppbnQgbGNtKGludCBhLCBpbnQgYikgeyByZXR1cm4gKGEgLyBnY2QoYSwgYikpICogYjsgfQoKaW50IHBvd2VyKGludCBhLCBpbnQgYiwgaW50IG0gPSBNT0QpIHsKICAgIGludCByZXMgPSAxOwogICAgd2hpbGUgKGIgPiAwKSB7CiAgICAgICAgaWYgKGIgJiAxKSByZXMgPSByZXMgKiBhICUgbTsKICAgICAgICBhID0gYSAqIGEgJSBtOwogICAgICAgIGIgPj49IDE7CiAgICB9CiAgICByZXR1cm4gcmVzOwp9CgppbnQgbW9kaW52KGludCBhLCBpbnQgbSA9IE1PRCkgewogICAgcmV0dXJuIHBvd2VyKGEsIG0gLSAyLCBtKTsKfQoKLy8gTG9naWMKdm9pZCBzb2x2ZSgpIHsKICAgIGludCBuLCBjOwogICAgY2luID4+IG4gPj4gYzsKICAgIGludCBhW25dOwoKICAgIHJlcChpLCAwLCBuKSBjaW4gPj4gYVtpXTsKICAgIHNvcnQoYSwgYSArIG4pOyAKCiAgICBpbnQgYW5zID0gSU5GOwoKICAgIHJlcChpLCAwLCBuICsgMSkgewogICAgICAgIGludCBjb3N0ID0gMDsKICAgICAgICByZXAoaiwgMCwgbikgewogICAgICAgICAgICBpbnQgdyA9IGFbal07CiAgICAgICAgICAgIGludCBtdWwgPSBtYXgoMExMLCBqIC0gKG4gLSBpKSk7IAogICAgICAgICAgICBpZiAobXVsID49IDYwKSB3ID0gSU5GOwogICAgICAgICAgICBlbHNlIHcgPDw9IG11bDsKICAgICAgICAgICAgaWYgKHcgPiBjKSBjb3N0Kys7CiAgICAgICAgfQogICAgICAgIGFucyA9IG1pbihhbnMsIGNvc3QpOwogICAgfQoKICAgIGNvdXQgPDwgYW5zIDw8IGVuZGw7Cn0KCi8vIE1haW4KaW50MzJfdCBtYWluKCkgewogICAgZmFzdF9pbzsKCiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkgewogICAgICAgIHNvbHZlKCk7CiAgICB9CgogICAgcmV0dXJuIDA7Cn0K