#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
using namespace std;
const int N = 1e5+5;
const ull P = 131;
inline int read() {
	int x=0,f=1;
	char c=0;
	while(!isdigit(c=getchar())) if(c=='-') f=-f;
	while(isdigit(c)) x=x*10+c-'0',c=getchar();
	return x*f;
}
int n, m,na,nb;
int siz[N],dfn;
ull f[N];
vector<int> lj_a[N],lj_b[N],lj[N];
unordered_map<ull,vector<int> > id;
unordered_map<ull,ull> mark,vis,cnt;
inline bool cmp(int u,int v) {
	return siz[u]<siz[v];
}

inline ull Hsh(ull x) {
	x=x*x;
	return ((x>>3)^(x<<5))*P+((x<<7)^(x>>4))+P;
}

inline void dfs(int now) {
	siz[now]=1,f[now]=0;
	for(auto to:lj[now]) dfs(to),siz[now]+=siz[to];
	sort(lj[now].begin(),lj[now].end(),cmp);
	++cnt[0];
	for(auto to:lj[now]) f[now]+=Hsh(f[to]),cnt[f[now]]++;
	id[f[now]].push_back(now);
}

inline ull dfs_a(int now,int x) {
	ull res=x;
	for(auto to:lj_a[now]) res+=Hsh(dfs_a(to,x));
	return res;
}

inline ull dfs_b(int now,int x) {
	ull res=x;
	for(auto to:lj_b[now]) res+=Hsh(dfs_b(to,x));
	return res;
}

inline void print(int now,int fath) {
	cout<<fath<<" ";
	int id=++dfn;
	for(auto to:lj[now]) print(to,id);
}

inline void clear() {
	id.clear(),mark.clear(),vis.clear(),cnt.clear();
	for(int i=1; i<=na; ++i) lj_a[i].clear();
	for(int i=1; i<=nb; ++i) lj_b[i].clear();
	for(int i=1; i<=n; ++i) lj[i].clear();
}

inline void solve() {
//	cout<<"-------------------------------------------\n";
	clear();
	na=read(),nb=read(),n=read();
	for(int i=1; i<=na; ++i) lj_a[read()].push_back(i);
	for(int i=1; i<=nb; ++i) lj_b[read()].push_back(i);
	for(int i=1; i<=n; ++i) lj[read()].push_back(i);
	dfs(1);
	for(auto it:cnt) {
		int x=it.first,Cnt=it.second+1;
		if(Cnt>=na) mark[dfs_a(1,x)]=x;
		if(Cnt>=nb) vis[dfs_b(1,x)]=x;
	}
//	cout<<"--------------------------------------\n";
//	for(auto it:cnt) cout<<it.first<<" "<<it.second<<"\n";
//	cout<<"--------------------------------------\n";
//	for(auto it:mark) cout<<it.first<<" "<<it.second<<"\n";
//	cout<<"--------------------------------------\n";
//	for(auto it:vis) cout<<it.first<<" "<<it.second<<"\n";
//	cout<<"--------------------------------------\n";
	for(auto it:mark) {
		ull rx=f[1]-it.first;
		if(vis.count(f[1]-it.first)) {
			int u=id[it.second][0],v=id[vis[rx]][0];
//			int u=it.second,v=vis[f[1]-it.first];
//			u=id[u][0],v=id[v][0];
			cout<<siz[u]<<" "<<siz[v]<<"\n";
			dfn=0,print(u,0),puts("");
			dfn=0,print(v,0),puts("");
			return ;
		}
	}
	puts("Impossible");
}

signed main() {
	int T=read();
	while(T--) solve();
	return 0;
}