#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>

#define fi first
#define se second
#define mkp std::make_pair
using ll=long long;
using llu=unsigned long long;
using std::max;
using std::min;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}

const int NV=1e5;

llu XS(llu x){
    x^=x<<13;
    x^=x>>7;
    x^=x<<17;
    return x*2+1;
}

namespace gph{
    std::map<llu,int> mp,mp2;
    std::vector<int> Ta[NV+5],Tb[NV+5],Tc[NV+5];
    llu hc[NV+5];
    int pa[NV+5],pb[NV+5],pc[NV+5],sc[NV+5];
    void dfsc(int x){
        ++mp[hc[x]=1];
        sc[x]=1;
        for(int t:Tc[x]){
            dfsc(t);
            sc[x]+=sc[t];
        }
        std::sort(Tc[x].begin(),Tc[x].end(),[&](int u,int v){
                return sc[u]<sc[v];});
        for(int t:Tc[x]){
            hc[x]*=XS(hc[t]);
            ++mp[hc[x]];
        }
        mp2[hc[x]]=x;
    }
    std::vector<llu> xx,yy,ax,ay;
    llu dfsa(int x,const llu v){
        llu ans=v;
        for(int t:Ta[x]) ans*=XS(dfsa(t,v));
        return ans;
    }llu dfsb(int x,const llu v){
        llu ans=v;
        for(int t:Tb[x]) ans*=XS(dfsb(t,v));
        return ans;
    }void chka(llu v){
        ax.push_back(v);
        xx.push_back(dfsa(1,v));
    }void chkb(llu v){
        ay.push_back(v);
        yy.push_back(dfsb(1,v));
    }
    int prc;
    void print(int x,int p){
        printf("%d ",p);
        int y=++prc;
        for(int t:Tc[x]) print(t,y);
    }
}

namespace xm{
    llu inv(llu x){llu y=x;for(int i=6;i--;) y*=2-x*y; return y;}
    void _(){
        int Na,Nb,Nc;

        scanf("%d%d%d",&Na,&Nb,&Nc);
        for(int i=1;i<=Na;++i){
            scanf("%d",gph::pa+i);
            if(i>1) gph::Ta[gph::pa[i]].push_back(i);
        }
        for(int i=1;i<=Nb;++i){
            scanf("%d",gph::pb+i);
            if(i>1) gph::Tb[gph::pb[i]].push_back(i);
        }
        for(int i=1;i<=Nc;++i){
            scanf("%d",gph::pc+i);
            if(i>1) gph::Tc[gph::pc[i]].push_back(i);
        }
        gph::dfsc(1);
        for(auto p:gph::mp){
            if(p.se>=Na-1){
                gph::chka(p.fi);
            }
            if(p.se>=Nb-1){
                gph::chkb(p.fi);
            }
        }
        std::map<llu,llu>mp3;
        for(int i=0;i<(int)gph::yy.size();++i)
            mp3[gph::yy[i]]=gph::ay[i];
        for(int i=0;i<(int)gph::xx.size();++i){
            auto nx=gph::xx[i];
            auto ny=gph::hc[1]*inv(nx);
            if(mp3.count(ny)){
                printf("%d %d\n",gph::sc[gph::mp2[gph::ax[i]]],
                        gph::sc[gph::mp2[mp3[ny]]]);
                gph::prc=0;
                gph::print(gph::mp2[gph::ax[i]],0); puts("");
                gph::prc=0;
                gph::print(gph::mp2[mp3[ny]],0); puts("");
                goto clear;
            }
        }
        puts("Impossible");
clear:  for(int i=1;i<=Na;++i) gph::Ta[i].clear();
        for(int i=1;i<=Nb;++i) gph::Tb[i].clear();
        for(int i=1;i<=Nc;++i) gph::Tc[i].clear();
        gph::mp.clear();
        gph::mp2.clear();
        gph::xx.clear();
        gph::yy.clear();
        gph::ax.clear();
        gph::ay.clear();
    }
}

int main(){
    int t;
    scanf("%d",&t);
    while(t--) xm::_();
    return 0;
}