#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, a, n) for(int i = a; i < n; i++)
#define rrep(i, a, n) for(int i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define ld long double

// using mint = modint1000000007;
// using mint = modint998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1e18;

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t; cin >> t;
    while(t--){

        int n; cin >> n;
        if(n == 2){
            cout << -1 << endl;
            return 0;
        }
        vector<int> r(n), c(n);
        rep(i, 0, n) cin >> r[i], r[i]--;
        rep(i, 0, n) cin >> c[i], c[i]--;
    
        vector<vector<int>> g(n, vector<int>(n));
        rep(i, 0, n){
            rep(j, 0, n){
                g[i][j] = max(i, j);
            }
        }
        g[0][n-1] = g[n-1][0] = 0;
    
        {
            vector<vector<int>> _g = g;
            rep(i, 0, n){
                rep(j, 0, n){
                    g[i][j] = _g[r[i]][c[j]];
                }
            }
        }
    
        rep(i, 0, n){
            rep(j, 0, n){
                cout << g[i][j]+1 << ' ';
            }
            cout << endl;
        }
    }
    
    return 0;
}