#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
    void add(X &x, const Y &y) {
        x = (x + y);
        if(x >= MOD) x -= MOD;
    }

template<class X, class Y>
    void sub(X &x, const Y &y) {
        x = (x - y);
        if(x < 0) x += MOD;
    }

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 20 + 10;
const int M = (1 << 20) + 10;

ll a[N], b[N];
vector<int> bit[M];
vector<int> v[21];
int cnt[M], ok[M];

void solve() {
    int n, H; cin >> n >> H;
    ll sum = 0;

    for(int i = 0; i < (1 << n); i++) cnt[i] = ok[i] = 0;

    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) {
        cin >> b[i];
        sum += b[i];
    }

    ll ans = 0;
    for(int msk = 0; msk < (1 << n); msk++) {
        ll x = 0, y = 0;
        for(auto i : bit[msk]) x += a[i], y += b[i];
        if(x >= H) cnt[msk ^ ((1 << n) - 1)]++;
        if(y >= H) ok[msk] = true;
    }

    for(int i = n - 1; i >= 0; i--) {
        for(auto msk : v[i]) cnt[msk] += cnt[msk ^ (1 << i)];
    }

    for(int msk = 0; msk < (1 << n); msk++) {
        ans += cnt[msk] * ok[msk];
    }

    cout << ans << '\n';
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else
    //online
    #endif

    int n = 20;
    for(int i = 1; i < (1 << n); i++) {
        for(int j = 0; j < n; j++) if(i >> j & 1) {
            bit[i].pb(j + 1);
            v[j].pb(i);
        }
    }

    int tc = 1, ddd = 0;
    cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}