#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
#define ll long long
#define ull unsigned ll
#define ld long double
#define bl __int128_t
#define fi first
#define se second
#define vel vector<ll>
#define vvel vector<vel>
#define pll pair<ll,ll>
#define vepll vector<pll>
#define vvepll vector<vepll>
#define ves vector<string>
#define vem vector<mint>
#define vvem vector<vem>
#define pmm pair<mint,mint>
#define cleout(i) cout<<fixed<<setprecision(i)
template<class T>using PQ=priority_queue<T,vector<T>,greater<T>>;
//               上  右 下 左
vector<int> di={-1, 0, 1, 0};
vector<int> dj={ 0, 1, 0,-1};

vector<int> dx={ 0, 1, 0,-1};
vector<int> dy={ 1, 0,-1, 0};


vector<int> ddx={ 1, 1, 1, 0, -1, -1, -1, 0 };
vector<int> ddy={ 1, 0, -1, -1, -1, 0, 1, 1 };

ll inf=1000000000000000000;//1e18
// LLONG_MAX

mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count());

void _solve(){
    ll N;
    cin>>N;
    vel r(N);
    vel c(N);
    rep(i,0,N)cin>>r[i];
    rep(i,0,N)cin>>c[i];
    rep(i,0,N)r[i]--;
    vel ir(N);
    rep(i,0,N)ir[r[i]]=i;
    if(*max_element(c.begin(),c.end())==*min_element(c.begin(),c.end())){
        if(N==1){
            cout<<"1\n";
            return ;
        }
        if(N<=4){
            cout<<"-1\n";
            return ;
        }else{
            vvel ans(N,vel(N,-1));
            pll now;
            now={(ir[c[0]-1]+1)%N,0};
            rep(i,0,N){
                if(i+1==N)now.fi++;
                now.fi%=N;
                ans[now.fi][now.se]=c[0]-1;
                now.fi++;
                now.se++;
                now.fi%=N;
                now.se%=N;
            }
            rep(i,0,N){
                if(r[i]==c[0]-1){
                    rep(j,0,N)ans[i][j]=c[0]-1;
                }else{
                    rep(j,0,N){
                        if(ans[i][j]<0){
                            ans[i][j]=r[i];
                        }
                    }
                }
            }
            rep(i,0,N){
                rep(j,0,N)cout<<ans[i][j]+1<<" ";
                cout<<"\n";
            }
            return ;
        }
    }
    vvel ans(N,vel(N,-1));
    vel cnt(N);
    vel sc=c;
    rep(i,0,N)sc[i]--;
    sort(sc.begin(),sc.end());
    ll p=c[0];
    rep(i,0,N){
        c[i]--;
        ans[c[i]][i]=c[i];
        cnt[c[i]]++;
        ans[p%N][i]=c[i];
        p++;
    }
    rep(i,0,N){
        rep(j,0,N){
            if(ans[i][j]<0)ans[i][j]=i;
        }
    }
    vvel nans(N,vel(N));
    rep(i,0,N){
        nans[i]=ans[r[i]];
    }
    vvel nnans(N,vel(N));
    vel idx(N);
    map<ll,vel> ma;
    rep(i,0,N)ma[c[i]].push_back(i);
    rep(j,0,N){
        rep(i,0,N){
            nnans[i][ma[c[j]][idx[c[j]]]]=nans[i][j];
        }
        idx[c[j]]++;
    }
    swap(ans,nnans);
    auto check=[&](){
        rep(i,0,N){
            vel cnt(N);
            rep(j,0,N){
                cnt[ans[i][j]]++;
            }
            ll m=*max_element(cnt.begin(),cnt.end());
            rep(j,0,N){
                if(m==cnt[ans[i][j]]&&ans[i][j]!=r[i])return 0;
            }
        }
        return 1;
    };
    if(check()){
        rep(i,0,N){
            rep(j,0,N){
                cout<<ans[i][j]+1<<" ";
            }
            cout<<"\n";
        }
    }else cout<<"-1\n";
}


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

    
    ll _;
    bool multitest=1;
    if(multitest)cin>>_;
    else _=1;
    rep(__,0,_){
        _solve();
    }
}