#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int N = 1e5 + 5;
int n, a[N], p[N], b[N], q[N];
void solve() {
  cin >> n;
  for(int i = 1; i <= n; i++) cin >> a[i], p[i] = i;
  for(int _ = 1; _ <= 1000; _++) {
    shuffle(p + 1, p + n + 1, rnd);
    bool ok = 1;
    for(int i = 1; i <= n && ok; i++)
      if(p[i] == i || a[p[i]] == i) ok = 0;
      else q[a[p[i]]] = i;
    if(ok) {
      puts("Possible");
      for(int i = 1; i <= n; i++) cout << p[i] << " "; cout << "\n";
      for(int i = 1; i <= n; i++) cout << q[i] << " "; cout << "\n";
      return;
    }
  }
  puts("Impossible");
}
int main() {
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  int T;
  cin >> T;
  while(T--) solve();
  return 0;
}