/*YYC is Thinking Here*/
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e7+10;

struct node{ int s,p; }a[maxn << 1];
bool cmps(node a,node b) { return a.s < b.s; }
int T,n,bas,ans[64],tp;
void roll(int w) {
	for(int i = 1,j = 1;i <= n;++i) {
		if(!a[i].p) continue;
		while(a[j].s != a[i].s+w) ++j;
		a[j].p -= a[i].p;
	}
	int m = 0;
	for(int i = 1;i <= n;++i) if(a[i].p) a[++m] = a[i];
	n = m;
}
void push(int w) {
	for(int i = 1;i <= n;++i) a[i+n] = {a[i].s+w,a[i].p};
	inplace_merge(a+1,a+n+1,a+2*n+1,cmps);
	int m = 0;
	for(int i = 1,c=0;i <= n+n;++i) {
		c += a[i].p;
		if(a[i].s != a[i+1].s)
			a[++m] = {a[i].s,c}, c = 0;
	} n=m;
}
signed main() {
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>T;
	for(int _ = 1;_ <= T;++_) {
		cin>>n;
		for(int i = 1;i <= n;++i) cin>>a[i].s;
		for(int i = 1;i <= n;++i) cin>>a[i].p;
		bas = -a[1].s;
		for(int i = 1;i <= n;++i) a[i].s += bas;
		int c0 = __lg(a[1].p);
		for(int i = 1;i <= n;++i) a[i].p >>= c0;
		tp = 0;
		while(n != 1) {
			ans[++tp] = a[n].s - a[n-1].s;
			roll(ans[tp]);
		}
		for(int i = 1;i <= tp;++i) push(ans[i]);
		sort(ans+1,ans+tp+1,greater<>());
		for(int i = 1;bas && i <= tp;++i)
			if(lower_bound(a+1,a+n+1,node{bas-ans[i]},cmps)->s == bas-ans[i])
				roll(ans[i]), ans[i] = -ans[i], bas += ans[i];
		while(c0--) ans[++tp] = 0;
		sort(ans+1,ans+tp+1);
		cout<<"Case #"<<_<<": ";
		for(int i = 1;i <= tp;++i) cout<<ans[i]<<' ';
		cout<<'\n';
	}
}

/*
* I love it all
* Go forward,move forward !
*/