#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,na,nb,nc;
int fa[3][100005];

namespace solver{
	int n,m,sz,_out;
	vector <int> son[100005];
	int fa[4][100005],label[2][100005];
	ull h(ull x){
		return x * x * 127 + x * 114 + 514;
	}

	ull f(ull x){
		return h(x >> 30) + h(x & ((1u << 30) - 1));
	}

	int dep[100005],siz[100005],tag[100005];
	ull A[2][100005];
	__gnu_pbds::gp_hash_table <ull,int> buc;
	void dfs(int u){
		label[0][u] = ++sz;
		fa[2][sz] = label[0][fa[1][u]];
		for(int v:son[u]){
			if(tag[v]) continue;
			dfs(v);
		}
	}
	void dfs2(int u,int f){
		label[1][u] = ++_out;
		fa[3][_out] = label[1][f];
		for(int v:son[u]) dfs2(v,u);
	}
	int solve(){
		rep(u,1,m) son[u].clear();
		rep(u,2,m) son[fa[1][u]].eb(u);
/*		printf("try solve n=%d m=%d\n",n,m);
		rep(u,1,n) printf("%d ",fa[0][u]);
		printf("\n");
		rep(u,1,m) printf("%d ",fa[1][u]);
		printf("\n");*/
		int p = 1,d1 = 0,d2 = 0;
		rep(u,2,m){
			dep[u] = dep[fa[1][u]] + 1;
			if(dep[u] > dep[p]) p = u;
		}
		d1 = dep[p];
		fill(siz,siz + m + 1,1);
		fill(A[0],A[0] + m + 1,1);
		per(u,m,2){
			siz[fa[1][u]] += siz[u];
			A[0][fa[1][u]] += f(A[0][u]);
		}
		rep(u,2,n){
			dep[u] = dep[fa[0][u]] + 1;
			chkmax(d2,dep[u]);
		}
		d1 -= d2;
		if(d1 < 0) return 0;
		while(d1){
			p = fa[1][p];
			d1--;
		}
//		printf("p=%d\n",p);
		if(!p || 1ll * siz[p] * n > m) return 0;

		fill(A[1],A[1] + n + 1,A[0][p]);
		per(u,n,2) A[1][fa[0][u]] += f(A[1][u]);
		__gnu_pbds::gp_hash_table <ull,int> ovo;
		buc.swap(ovo);
		rep(u,2,n) if(fa[0][u] == 1) buc[A[1][u]]++;
		rep(u,1,m) if(fa[1][u] == p) buc[A[0][u]]++;

		fill(tag,tag + m + 1,0);
		rep(u,2,m){
			if(fa[1][u] == 1 && buc[A[0][u]]){
				tag[u] = 1;
//				printf("del %d\n",u);
				buc[A[0][u]]--;
			}
		}
		for(pair <ull,int> I:buc) if(I.second) return 0;
		sz = _out = 0;
		dfs(1);
		dfs2(p,0);
/*		printf("succ!\n");
		printf("sz=%d\n",sz);
		rep(u,1,sz) printf("%d ",fa[2][u]);
		printf("\n_out=%d\n",_out);
		rep(u,1,_out) printf("%d ",fa[3][u]);
		printf("\n");*/
		return 1;
	}	
}

int sz;
int temp[100005];
int check(int tp){
	solver::n = na;solver::m = nc;
	rep(u,1,na) solver::fa[0][u] = fa[0][u];
	rep(u,1,nc) solver::fa[1][u] = fa[2][u];
	if(!solver::solve()) return 0;
	solver::n = nb;solver::m = solver::sz;
	rep(u,1,nb) solver::fa[0][u] = fa[1][u];
	rep(u,1,solver::m) solver::fa[1][u] = solver::fa[2][u];
	sz = solver::_out;
	rep(u,1,sz) temp[u] = solver::fa[3][u];
	if(!solver::solve()) return 0;
	if(solver::sz != 1) return 0;
//	printf("[output]\n");
	if(!tp){
		printf("%d %d\n",sz,solver::_out);
		rep(u,1,sz) printf("%d%c",temp[u]," \n"[u == sz]);
		rep(u,1,solver::_out) printf("%d%c",solver::fa[3][u]," \n"[u == solver::_out]);
	}else{
		printf("%d %d\n",solver::_out,sz);	
		rep(u,1,solver::_out) printf("%d%c",solver::fa[3][u]," \n"[u == solver::_out]);
		rep(u,1,sz) printf("%d%c",temp[u]," \n"[u == sz]);
	}
	return 1;
}

void solve(){
	scanf("%d%d%d",&na,&nb,&nc);
	rep(u,1,na) scanf("%d",&fa[0][u]);
	rep(u,1,nb) scanf("%d",&fa[1][u]);
	rep(u,1,nc) scanf("%d",&fa[2][u]);
	if(check(0)) return;
	swap(na,nb);
	rep(u,1,max(na,nb)) swap(fa[0][u],fa[1][u]);
	if(check(1)) return;
	printf("Impossible\n");
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}