#include<stdio.h>
#include<algorithm>
#include<random>
#include<map>
#include<time.h>
#define M 100005
using namespace std;
typedef unsigned long long ull;
inline ull trans(ull x){
	x^=(x>>29)&0x5555555555555555ULL,
	x^=(x<<17)&0x71D67FFFEDA60000ULL,
	x^=(x<<37)&0xFFF7EEE000000000ULL,
	x^=(x>>43);
	return x;
}
struct Tree{
	int n,f[M],sz[M],dep[M],mxd;
	ull H[M];
	inline void read(){
		for(int i=1;i<=n;++i) scanf("%d",f+i),sz[i]=0;
		for(int i=n;i;--i) ++sz[i],sz[f[i]]+=sz[i];
		mxd=0;
		for(int i=1;i<=n;++i) dep[i]=dep[f[i]]+1,mxd=max(mxd,dep[i]);
	}
	inline void work(ull w){
		for(int i=1;i<=n;++i) H[i]=w;
		for(int i=n;i;--i) H[f[i]]+=trans(H[i]);
	}
} A,B,C;
vector<int> G[M];
map<ull,bool> sX,sY;
map<ull,int> mX,mY;
mt19937_64 rnd(time(0));
int tot;
void out(int x,int fa){
	printf("%d ",fa);
	int c=++tot;
	for(int p:G[x]) out(p,c);
}
inline void solve(){
	scanf("%d%d%d",&A.n,&B.n,&C.n);
	A.read(),B.read(),C.read();
	ull w=rnd();
	A.work(w),B.work(w),C.work(w),sX.clear(),sY.clear(),mX.clear(),mY.clear();
	for(int i=1;i<=C.n;++i){
		G[i].clear();	
		if(C.dep[i]==A.mxd&&!sX[C.H[i]]){
			sX[C.H[i]]=1,A.work(C.H[i]);
			mX[A.H[1]]=i;
		}
		if(C.dep[i]==B.mxd&&!sY[C.H[i]]){
			sY[C.H[i]]=1,B.work(C.H[i]);
			mY[B.H[1]]=i;
		}
		G[C.f[i]].push_back(i);
	}
	for(auto [Hx,x]:mX){
		ull Hy=C.H[1]+w-Hx;
		auto it=mY.find(Hy);
		if(it==mY.end()) continue;
		int y=it->second;
		printf("%d %d\n",C.sz[x],C.sz[y]);
		tot=0,out(x,0),putchar('\n'),
		tot=0,out(y,0),putchar('\n');
		return;
	}
	puts("Impossible");
}
int main(){
	// freopen("in.txt","r",stdin);
	int T;scanf("%d",&T);
	while(T--) solve();
}