#include<bits/stdc++.h>
using namespace std;
using ll=long long;

void solve(){
    ll N;
    cin>>N;

    vector<ll> P(N),Q(N);
    for(int i=0;i<N;i++){
        cin>>P[i];
        P[i]--;
    }
    for(int i=0;i<N;i++){
        cin>>Q[i];
        Q[i]--;
    }
    if(N==2){
        cout<<-1<<"\n";
        return;
    }
    auto OQ=Q;
    sort(OQ.begin(),OQ.end());
    if(OQ[0]==OQ.back()){
        cout<<-1<<"\n";
        return;
    }
    vector<vector<ll>> AN(N,vector<ll>(N,-1));
    vector<bool> US(N,0),USQ(N,0);
    for(int i=0;i<N;i++){
        if(i==0||OQ[i-1]!=OQ[i]){
            US[i]=1;
            USQ[OQ[i]]=1;
            int y=OQ[i];
            int x=i;
            for(int j=0;j<(N+2)/2;j++){
                AN[y][x]=y;
                x++;
                x%=N;
            }
        }
    }
    for(int i=0;i<N;i++){
        if(USQ[i])continue;
        for(int j=0;j<N;j++){
            if(!US[j]){
                US[j]=1;
                int y=i;
                int x=j;
                for(int j=0;j<(N+2)/2;j++){
                    AN[y][x]=y;
                    x++;
                    x%=N;
                }
                break;
            }
        }
    }
    vector<vector<int>> DD(N);
    for(int i=0;i<N;i++){
        DD[OQ[i]].push_back(i);
    }
    vector<int> QM(N);
    for(int i=0;i<N;i++){
        QM[i]=DD[Q[i]].back();
        DD[Q[i]].pop_back();
    }
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            if(AN[i][j]==-1)AN[i][j]=OQ[j];
        }
    }
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            cout<<AN[P[i]][QM[j]]+1<<" \n"[j==N-1];
        }
    }

}


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

    int T;
    cin>>T;
    for(int t=0;t<T;t++)solve();
    
}