#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;
int n, a[N], p[N], q[N], rva[N], rvp[N], vis[N], tot, t[N];
vector<int> P[] = {{0, 2, 3, 1}, {0, 3, 1, 2}};

void dfs(int x) {
    if (vis[x]) return;
    vis[x] = 1;
    t[++tot] = x;
    dfs(a[x]);
}

bool solve() {
    if (n == 1) {
        return 0;
    } else if (n == 2) {
        if (a[1] == 1 && a[2] == 2) {
            p[1] = q[1] = 2, p[2] = q[2] = 1;
            return 1;
        } else {
            return 0;
        }
    } else if (n == 3) {
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < 2; j++) {
                int flag = 1;
                for (int k = 1; k <= 3; k++) {
                    flag &= a[P[i][P[j][k]]] == k;
                }
                if (flag) {
                    p[1] = P[i][1], p[2] = P[i][2], p[3] = P[i][3];
                    q[1] = P[j][1], q[2] = P[j][2], q[3] = P[j][3];
                    return 1;
                }
            }
        }
        return 0;
    }
    for (int i = 1; i <= n; i++) {
        if (!vis[i]) {
            dfs(i);
        }
    }
    for (int i = 1; i <= n; i++) {
        int nex = i + 2;
        if (nex > n) {
            nex -= n;
        }
        rvp[t[i]] = t[nex];
    }
    for (int i = 1; i <= n; i++) {
        q[i] = rvp[rva[i]];
        p[rvp[i]] = i;
    }
    return 1;
}

int main() {
    int T; scanf("%d", &T);
    while (T--) {
        scanf("%d", &n), tot = 0;
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            rva[a[i]] = i;
            vis[i] = 0;
        }
        if (solve()) {
            printf("Possible\n");
            for (int i = 1; i <= n; i++) {
                printf("%d ", p[i]);
            }
            printf("\n");
            for (int i = 1; i <= n; i++) {
                printf("%d ", q[i]);
            }
            printf("\n");
        } else {
            printf("Impossible\n");
        }
    }
    return 0;
}