#include <iostream>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>

using namespace std;

#define saleh                         \
    ios_base::sync_with_stdio(false); \
    cin.tie(nullptr);
#define ll long long

int main()
{

    saleh;

    int t;
    cin >> t;
    while (t--)
    {
        int n, sum;
        cin >> n >> sum;
        int ans = 0;
        vector<int> v(n);
        for (int i = 0; i < n; i++)
            cin >> v[i];

        for (int mask = 0; mask < (1 << n); mask++)
        {
            int s = 0;
            for (int i = 0; i < n; i++)
            {
                if (mask & (1 << i))
                {
                    s += v[i];
                }
            }
            int bits = __builtin_popcount(mask);
            if (s < sum)
                continue;

            bool flag = 0;
            for (int i = 0; i < n; i++)
            {
                if (mask & (1 << i))
                {
                    if (s - v[i] >= sum)
                        flag = 1;
                }
            }
            if (!flag)
                ans = max(ans, bits);
        }

        cout << ans << endl;
    }
}