#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct StronglyConnectedComponents{
    vector<vector<int>> g;
    vector<vector<int>> to,from;
    vector<int> comp,order,used;
    StronglyConnectedComponents(vector<vector<int>> &g):
    g(g),to(g.size()),from(g.size()),comp(g.size(),-1),used(g.size()){
        for(int i=0;i<g.size();i++){
            for(auto x:g[i]){
                to[i].push_back(x);
                from[x].push_back(i);
            }
        }
    }
    int operator[](int k){
        return comp[k];
    }
    void dfs(int now){
        if(used[now]) return ;
        used[now]=true;
        for(int x:to[now])dfs(x);
        order.push_back(now);
    }
    void rdfs(int now,int cnt){
        if(comp[now]!=-1) return ;
        comp[now]=cnt;
        for(int x:from[now]) rdfs(x,cnt);
    }
    vector<vector<int>> build(){
        vector<vector<int>> t;
        for(int i=0;i<to.size();i++) dfs(i);
        reverse(order.begin(),order.end());
        int ptr=0;
        for(int i:order)if(comp[i]==-1)rdfs(i,ptr),ptr++;
 
        t.resize(ptr);
        for(int i=0;i<g.size();i++){
            for(auto v:to[i]){
                int x=comp[i],y=comp[v];
                if(x==y) continue;
                t[x].push_back(y);
            }
        }
        return t;
    }
};

// need SCC
struct TwoSat{
    int sz;
    vector<vector<int>> g;
    TwoSat(int v):sz(v),g(2*v){}
    // !x
    inline int rev(int x){
        if(x>=sz) return x-sz;
        else return x+sz;
    }
    // u->v <=> !v->!u 2つ同時に張る
    void add_if(int u,int v){
        g[u].push_back(v);
        g[rev(v)].push_back(rev(u));
    }
    // u+v <=> !u->v and !v->u
    void add_or(int u,int v){
        add_if(rev(u),v);
    }
    // not(u*v) <=> u->!v and v->!u
    void add_nand(int u,int v){
        add_if(u,rev(v));
    }
    // u <=> !u->u 
    void set_true(int u){
        g[rev(u)].push_back(u);
    }
    // !u <=> u->!u
    void set_false(int u){
        g[u].push_back(rev(u));
    }

    vector<int> build(){
        StronglyConnectedComponents scc(g);
        auto t=scc.build();
        vector<int> ret(sz);
        for(int i=0;i<sz;i++){
            if(scc[i]==scc[rev(i)]) return vector<int>();
            ret[i]=(scc[i]>scc[rev(i)]);
        }
        return ret;
    }
};


signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n;cin>>n;
    auto unfold=[&](int x){
        return make_pair(x/n,x%n);
    };

    vector<int> s(n),t(n),u(n);
    rep(i,n) cin>>s[i];
    rep(i,n) cin>>t[i];
    rep(i,n) cin>>u[i];
    TwoSat ts(n*n);

    rep(i,n){
        s[i]--,t[i]--;
        rep(j,n){
            int a=s[i]*n+j,b=j*n+t[i];
            if(u[i]==0) ts.add_nand(ts.rev(a),ts.rev(b));
            if(u[i]==1) ts.add_nand(a,ts.rev(b));
            if(u[i]==2) ts.add_nand(ts.rev(a),b);
            if(u[i]==3) ts.add_nand(a,b);
        }
    }
    auto res=ts.build();
    if(res.empty()) cout<<-1<<endl;
    else{
        int ans[n][n];
        rep(k,n*n){
            auto p=unfold(k);
            int i=p.first,j=p.second;
            ans[i][j]=res[k];
        }
        rep(i,n)rep(j,n)cout<<ans[i][j]<<(j+1==n?"\n":" ");
    }
    return 0;
}