#include<bits/stdc++.h>
#define ull unsigned long long
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=1e5+10;
int T,a,b,n,tp[MAXN];
ull ha[MAXN],hb[MAXN],h[MAXN];
ull mask;
mt19937 myrand(time(NULL));
ull shift(ull x) {return x^=mask,x^=x<<13,x^=x>>7,x^=x<<17,x^=mask,x;}
struct Tree {
	vector<int> G[MAXN];
	int dep[MAXN],sze[MAXN];
	ull h[MAXN];
	void dfs(int u) {
		sze[u]=1,h[u]=1;
		for(auto v:G[u]) dep[v]=dep[u]+1,dfs(v),sze[u]+=sze[v],h[u]+=shift(h[v]);
		return ;
	}
	ull calc(int u,ull x) {
		ull ans=x;
		for(auto v:G[u]) ans+=shift(calc(v,x));
		return ans;	
	}
	void init(int n) {
		ffor(i,1,n) G[i].clear();
		ffor(i,1,n) {int f;cin>>f,G[f].push_back(i);}
		dfs(1);
		return ;
	}
	void output(int u,int fa,int &tot) {
		int id=++tot;
		cout<<fa<<' ';
		for(auto v:G[u]) output(v,id,tot);
		return ;
	}
}A,B,C;
int main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>T;
	while(T--) {
		mask=myrand()*myrand();
		cin>>a>>b>>n;
		A.init(a),B.init(b),C.init(n);
		int mxa=0,mxb=0;
		ffor(i,1,a) mxa=max(mxa,A.dep[i]);
		ffor(i,1,b) mxb=max(mxb,B.dep[i]);
		map<ull,int> mpa,mpb,usa,usb;
		ffor(i,1,n) if(C.dep[i]==mxa) {
			if(a<=n/C.sze[i]&&!usa[C.h[i]]) {
				usa[C.h[i]]=1;
				mpa[A.calc(1,C.h[i])]=i;	
			}
		}
		ffor(i,1,n) if(C.dep[i]==mxb) {
			if(b<=n/C.sze[i]&&!usb[C.h[i]]) {
				usb[C.h[i]]=1;
				mpb[B.calc(1,C.h[i])]=i;	
			}
		}
		int flg=0;
		for(auto pr:mpa) {
			ull val=pr.first,x=C.h[1]+1-val;
			if(mpb[x]) {
				int id1=pr.second,id2=mpb[x];
				cout<<C.sze[id1]<<' '<<C.sze[id2]<<'\n';
				int tot1=0,tot2=0;
				C.output(id1,0,tot1),cout<<'\n',C.output(id2,0,tot2);
				flg=1;break ;
			}
			//val+x=hsh[1]+1	
		}
		if(!flg) cout<<"Impossible\n";
	}
	return 0;
}