#include<bits/stdc++.h>
using namespace std;
template<class T1,class T2> bool cmax(T1& a,const T2& b){return a<b?a=b,1:0;}
template<class T1,class T2> bool cmin(T1& a,const T2& b){return b<a?a=b,1:0;}
#define fir(i,x,y,...) for(int i(x),##__VA_ARGS__;i<=(y);i++)
#define firr(i,x,y,...) for(int i(x),##__VA_ARGS__;i>=(y);i--)
#define fird(i,x,y,d,...) for(int i(x),##__VA_ARGS__;i<=(y);i+=(d))
#define firrd(i,x,y,d,...) for(int i(x),##__VA_ARGS__;i>=(y);i-=(d))
#define Yes cout<<"Yes\n"
#define No cout<<"No\n"
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define endl "\n"
#define ll long long
#define ull unsigned long long
int T;
bool _mul=1;
ll gcd(ll x,ll y){if(!y) return x;return gcd(y,x%y);}
ll power(ll b,ll p,ll mod){ll res=1;while(p){if(p&1) res=res*b%mod;b=b*b%mod;p>>=1;}return res;}
const int N=1e5+5,B=131;
int na,nb,nc;
vector<int> ea[N],eb[N],ec[N];
int siz[N],tot;
ull h[N];
unordered_map<ull,ull> mp,a,b,c;
ull hsh(ull x){return x*x*x*x+x*x*x*B+x*x*B*B+x*B*B*B+B*B*B*B;}
ull dfsa(int u,ull x)
{
	ull res=x;
	for(int v:ea[u]) res+=hsh(dfsa(v,x));
	return res;
}
ull dfsb(int u,ull x)
{
	ull res=x;
	for(int v:eb[u]) res+=hsh(dfsb(v,x));
	return res;
}
void dfsc(int u)
{
	siz[u]=1;
	for(int v:ec[u]) dfsc(v),siz[u]+=siz[v];
	sort(ec[u].begin(),ec[u].end(),[](int x,int y){return siz[x]<siz[y];});
	mp[0]++;
	for(int v:ec[u]) h[u]+=hsh(h[v]),mp[h[u]]++;
	c[h[u]]=u;
}
void print(int u,int fa=0)
{
	int res=++tot;
	cout<<fa<<" ";
	for(int v:ec[u]) print(v,res);
}
void solve()
{
	cin>>na>>nb>>nc;
	fir(i,1,na,x) cin>>x,ea[x].push_back(i);
	fir(i,1,nb,x) cin>>x,eb[x].push_back(i);
	fir(i,1,nc,x) cin>>x,ec[x].push_back(i);
	dfsc(1);
	for(auto [x,cnt]:mp)
	{
		if(cnt>=na-1) a[dfsa(1,x)]=x;
		if(cnt>=nb-1) b[dfsb(1,x)]=x;
	}
	bool flag=0;
	for(auto [x,y]:a) if(b.count(h[1]-x))
	{
		int ansx=c[y],ansy=c[b[h[1]-x]];
		cout<<siz[ansx]<<" "<<siz[ansy]<<endl;
		tot=0,print(ansx),cout<<endl;
		tot=0,print(ansy),cout<<endl;
		flag=1;
		break;
	}
	if(!flag) cout<<"Impossible"<<endl;
	fir(i,0,na) ea[i].clear();
	fir(i,0,nb) eb[i].clear();
	fir(i,0,nc) ec[i].clear(),h[i]=0;
	mp.clear(),a.clear(),b.clear(),c.clear();
	return;
}
int main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin.tie(nullptr)->sync_with_stdio(false);
	if(_mul) cin>>T;
	else T=1;
	while(T--) solve();
	return 0;
}