#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
int a, b, c;
vector<int> A[200005], B[200005], C[200005];
int sz[200005];
unsigned long long H[200005];
inline unsigned long long f(unsigned long long x) { return 3225 * x * x * x + 3653 * x * x + 3929; }
inline unsigned long long F(unsigned long long x) { return f(x & ((1ull << 31) - 1)) + f(x >> 31); }
map<unsigned long long, int> mp;
map<unsigned long long, unsigned long long> mp1, mp2;
void dfs1(int x) {
    sz[x] = 1 + (H[x] = 0);
    for (auto v : C[x]) {
        dfs1(v);
        sz[x] += sz[v];
    }
    sort(C[x].begin(), C[x].end(), [](int a, int b) { return sz[a] < sz[b]; });
    ++mp[0];
    for (auto v : C[x]) {
        H[x] += F(H[v]);
        ++mp[H[x]];
    }
}
unsigned long long dfs2(int x, unsigned long long w) {
    unsigned long long ret = w;
    for (auto v : A[x]) ret += F(dfs2(v, w));
    return ret;
}
unsigned long long dfs3(int x, unsigned long long w) {
    unsigned long long ret = w;
    for (auto v : B[x]) ret += F(dfs3(v, w));
    return ret;
}
int ncnt;
void dfs4(int x, int fa) { cout << fa << " "; int id = ++ncnt; for (auto v : C[x]) dfs4(v, id); }
int main() {
    // freopen("x.in", "r", stdin);
    // freopen("x.out", "w", stdout);
    int tc;
    cin >> tc;
    while (tc--) {
        mp.clear();
        mp1.clear();
        mp2.clear();
        cin >> a >> b >> c;
        for (int i = 0; i <= a; i++) A[i].clear();
        for (int i = 0; i <= b; i++) B[i].clear();
        for (int i = 0; i <= c; i++) C[i].clear();        
        for (int i = 1, x; i <= a; i++) cin >> x, A[x].emplace_back(i);
        for (int i = 1, x; i <= b; i++) cin >> x, B[x].emplace_back(i);
        for (int i = 1, x; i <= c; i++) cin >> x, C[x].emplace_back(i);
        dfs1(C[0][0]);
        for (auto v : mp) {
            unsigned long long w = v.first;
            if (v.second >= a - 1) 
                mp1[dfs2(A[0][0], w)] = w;
            if (v.second >= b - 1) 
                mp2[dfs3(B[0][0], w)] = w;
        }
        bool ok = 0;
        for (auto v : mp1) {
            unsigned long long hx = v.first, hy = H[C[0][0]] - hx;
            if (mp2.count(hy)) {
                hx = v.second, hy = mp2[hy];
                int rx = c, ry = c;
                for (int i = 1; i <= c; i++) {
                    if (H[i] == hx) 
                        rx = i;
                    if (H[i] == hy) 
                        ry = i;
                }
                cout << sz[rx] << " " << sz[ry] << "\n";
                ncnt = 0, dfs4(rx, 0), cout << "\n";
                ncnt = 0, dfs4(ry, 0), cout << "\n";
                ok = 1;
                break;
            }
        }
        if (!ok) 
            cout << "Impossible\n";
    }
    return 0;
}