#include<bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define double long double
#define endl '\n'
const int B=131;
int rnd(int x){return x*x*x*x+x*x*x*B+x*x*B*B+x*B*B*B+B*B*B*B;}
int na,nb,nc,fa[100009],fb[100009],fc[100009],szc[100009],hc[100009],dfnc;
vector<int> ga[100009],gb[100009],gc[100009];
unordered_map<int,vector<int> > cf;
unordered_map<int,int> cx,cy,cnt;
void dfs(int u){
	szc[u]=1;hc[u]=0;
	for(int v:gc[u])dfs(v),szc[u]+=szc[v];
	sort(gc[u].begin(),gc[u].end(),[&](int x,int y){return szc[x]<szc[y];});
	cnt[0]++;
	for(int v:gc[u])cnt[hc[u]+=rnd(hc[v])]++;
	cf[hc[u]].push_back(u);
}
int mula(int u,int x){int res=x;for(int v:ga[u])res+=rnd(mula(v,x));return res;}
int mulb(int u,int x){int res=x;for(int v:gb[u])res+=rnd(mulb(v,x));return res;}
void print(int u,int f){cout<<f<<' ';int p=++dfnc;for(int v:gc[u])print(v,p);}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int cas;cin>>cas;
	while(cas--){
		cin>>na>>nb>>nc;
		cf.clear();cx.clear();cy.clear();cnt.clear();
		for(int i=1;i<=na;i++)ga[i].clear(),cin>>fa[i];
		for(int i=1;i<=nb;i++)gb[i].clear(),cin>>fb[i];
		for(int i=1;i<=nc;i++)gc[i].clear(),cin>>fc[i];
		for(int i=1;i<=na;i++)ga[fa[i]].push_back(i);
		for(int i=1;i<=nb;i++)gb[fb[i]].push_back(i);
		for(int i=1;i<=nc;i++)gc[fc[i]].push_back(i);
		dfs(1);
		for(auto p:cnt){
			if(p.second>=na-1)cx[mula(1,p.first)]=p.first;
			if(p.second>=nb-1)cy[mulb(1,p.first)]=p.first;
		}
		bool fl=0;
		for(auto p:cx){
			int rx=hc[1]-p.first;
			if(cy.count(rx)){
				int x=cf[p.second][0],y=cf[cy[rx]][0];
				cout<<szc[x]<<' '<<szc[y]<<endl;
				dfnc=0;print(x,0);cout<<endl;
				dfnc=0;print(y,0);cout<<endl;
				fl=1;break;
			}
		}
		if(!fl)cout<<"Impossible\n";
	}
	return 0;
}