#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
 
 
#define FOR(i, x, n) for(ll i = x; i < n; i++) 
#define pb push_back
#define pf push_front
#define ll long long
#define hii cout << "hii" << endl
#define pii pair<int, int>
#define pll pair<ll, ll>
#define int ll
#define mpp make_pair
#define endl '\n'
#define ff first 
#define ss second
#define vi vector<int>
#define all(s) s.begin(), s.end()
#define si size()
 
template <class T> ostream& operator << (ostream &os, const vector<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T> ostream& operator << (ostream &os, const set<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T, class S> ostream& operator << (ostream &os, const pair<T, S> &v) { os << v.first << ' ' << v.second; return os; }
template <class T, class S> ostream& operator << (ostream &os, const unordered_map<T, S> &v) { for (auto i : v) os << '(' << i.first << "=>" << i.second << ')' << ' '; return os; } 
 
 
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template <class Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << " : " << arg1 << endl; }
    template <class Arg1, class... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args) {
        const char* sep = strchr(names + 1, ',');
        cerr.write(names, sep - names) << " : " << arg1 << "  ";
        __f(sep + 1, args...);
    }
#else
#define trace(...) 0
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif // ifndef ONLINE_JUDGE


typedef
tree<
  pair<int,int>,
  null_type,
  less<pair<int,int>>,
  rb_tree_tag,
  tree_order_statistics_node_update>
ordered_set;
 
 
const int N = 1 << 12;
const int mod = 1e9 + 7;
int query = 1;
vector<pii> s1, s2;
int arr[22];
int brr[22];
int n, h;
void print(int ret)
{
    cout << "Case #" << query++ << ": " << ret << endl;
}



void f(int idx, int cnt1, int cnt2)
{
	if(idx == n / 2)
	{
		s1.push_back({cnt1,cnt2});
		return;
	}
	f(idx + 1, cnt1 + arr[idx], cnt2);
	f(idx + 1, cnt1, cnt2 + brr[idx]);
    f(idx + 1, cnt1 + arr[idx], cnt2 + brr[idx]);
}
void g(int idx, int cnt1, int cnt2)
{
	if(idx == n)
	{
		s2.push_back({cnt1,cnt2});
		return;
	}
	g(idx + 1, cnt1 + arr[idx], cnt2);
	g(idx + 1, cnt1, cnt2 + brr[idx]);
    g(idx + 1, cnt1 + arr[idx], cnt2 + brr[idx]);
}

void solve()
{
	s1.clear();
	s2.clear();
	cin >> n >> h;
	for(int i = 0; i < n; i++)
	{
		cin >> arr[i];
	}
	for(int i = 0; i < n; i++)
	{
		cin >> brr[i];
	}
	f(0, 0, 0);
	g(n / 2, 0, 0);
	int n = s1.size(), m = s2.size();
	sort(all(s1));
	sort(all(s2));
	int j = m - 1;
	int ret = 0;
	ordered_set os;
	int el = 0;
	int sz = 0;
	for(int i = 0; i < n; i++)
	{
		// for(int j = 0; j < m; j++)
		// {
		// 	if(s1[i].first + s2[j].first)
		// 	{

		// 	}
		// }
		while(j >= 0 and s1[i].first + s2[j].first >= h)
		{
			el++;
			os.insert({s2[j].second, sz++});
			// mp[s2[j].second]++;
			j--;
		}
		int ptr2 = j + 1;
		if(ptr2 == m)
		{
			continue;
		}
		if(s1[i].second >= h)
		{
			ret += el;
			continue;
		}
		int x = h - s1[i].second;
		int kitnebadey = os.size() - os.order_of_key({x, 0});
		ret += kitnebadey;
	}
	print(ret);
}
 
 
int32_t main()
{	
    ios_base:: sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
// 	#ifndef ONLINE_JUDGE
// 	    freopen("input.txt", "r", stdin);
// 	    freopen("output.txt", "w", stdout);
// 	#endif
	int t = 1;
	cin >> t;
	while(t--)solve();
	return 0;
}