#include<bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int MAXN=1e5+5;
ull H(ull x) {
	auto _=[&](ull z) { return z*z*z+z*z*5+9*z+8; };
	return _(x>>32)+_(x&(-1u));
}
int na,nb,nc,fa[MAXN],fb[MAXN],fc[MAXN];
vector <int> A[MAXN],B[MAXN],C[MAXN];
int siz[MAXN];
ull f[MAXN];
map <ull,int> cnt;
void dfs1(int u) {
	siz[u]=1,f[u]=0;
	for(int v:C[u]) dfs1(v),siz[u]+=siz[v];
	sort(C[u].begin(),C[u].end(),[&](int x,int y){ return siz[x]<siz[y]; });
	++cnt[f[u]];
	for(int v:C[u]) f[u]+=H(f[v]),++cnt[f[u]];
}
ull dfs2(int u,ull w) {
	ull z=w;
	for(int v:A[u]) z+=H(dfs2(v,w));
	return z;
}
ull dfs3(int u,ull w) {
	ull z=w;
	for(int v:B[u]) z+=H(dfs3(v,w));
	return z;
}
void dfs4(int u,int fz,int &idx) {
	int x=++idx; cout<<fz<<" ";
	for(int v:C[u]) dfs4(v,x,idx);
}
void solve() {
	cin>>na>>nb>>nc,cnt.clear();
	for(int i=0;i<=na;++i) A[i].clear();
	for(int i=0;i<=nb;++i) B[i].clear();
	for(int i=0;i<=nc;++i) C[i].clear();
	for(int i=1;i<=na;++i) cin>>fa[i],A[fa[i]].push_back(i);
	for(int i=1;i<=nb;++i) cin>>fb[i],B[fb[i]].push_back(i);
	for(int i=1;i<=nc;++i) cin>>fc[i],C[fc[i]].push_back(i);
	dfs1(C[0][0]);
	map <ull,ull> ha,hb;
	for(auto it:cnt) {
		ull hv=it.first; int w=it.second;
		if(w>=na-1) ha[dfs2(A[0][0],hv)]=hv;
		if(w>=nb-1) hb[dfs3(B[0][0],hv)]=hv;
	}
	for(auto it:ha) {
		ull rem=f[C[0][0]]-it.first,tx=it.second;
		if(hb.count(rem)) {
			ull ty=hb[rem];
			int x=0,y=0;
			for(int i=1;i<=nc;++i) {
				if(f[i]==tx) x=i;
				if(f[i]==ty) y=i;
			}
			cout<<siz[x]<<" "<<siz[y]<<"\n";
			int cx=0,cy=0;
			dfs4(x,0,cx),cout<<"\n";
			dfs4(y,0,cy),cout<<"\n";
			return ;
		}
	}
	cout<<"Impossible\n";
	return ;
}
signed main() {
	ios::sync_with_stdio(false);
	int T; cin>>T;
	while(T--) solve();
	return 0;
}