#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

class strong_components{
private:
    vector<vector<int>> v,rv,nv;
    vector<int> rs,visited,cmp,cmp_size;
    void dfs(int n){
        visited[n] = 1;
        for(auto x:v[n]) if(!visited[x]) dfs(x);
        rs.push_back(n);
    }
    void rdfs(int n,int cnt){
        visited[n] = 1;
        cmp[n] = cnt;
        for(auto x:rv[n]) if(!visited[x]) rdfs(x,cnt);
    }
public:
    strong_components(int N,vector<vector<int>>& graph){
        v = graph;
        rv = vector<vector<int>>(N);
        visited = cmp = cmp_size = vector<int>(N,0);
        for(int i=0;i<N;i++) for(auto x:v[i]) rv[x].push_back(i);
        for(int i=0;i<N;i++) if(!visited[i]) dfs(i);
        for(int i=0;i<N;i++) visited[i] = 0;
        int now = 0;
        for(int i=(int) rs.size()-1;i>=0;i--) if(!visited[rs[i]]) rdfs(rs[i],now++);
        nv = vector<vector<int>>(now);
        for(int i=0;i<N;i++){
            for(auto x:v[i]){
                if(cmp[i]!=cmp[x]){
                    nv[cmp[i]].push_back(cmp[x]);
                    cmp_size[cmp[x]]++;
                }
            }
        }
    }
    int find(int n){return cmp[n];}
    bool is_same_group(int a,int b){return cmp[a]==cmp[b];}
};

class SAT{
private:
    int N;
    vector<vector<int>> v;
public:
    SAT(int N):N(N){
        v = vector<vector<int>>(2*N);
    }
    void add_closure(int x, int y ,bool bx, bool by){
        v[x+(!bx)*N].push_back(y+by*N);
        v[y+(!by)*N].push_back(x+bx*N);
    }
    vector<int> solve(){
        strong_components scc(2*N,v);
        //不可能か判定
        vector<int> res(N);
        for(int i=0;i<N;i++){
            //同じ強連結成分にあったらだめ
            if(scc.is_same_group(i,i+N)) return vector<int> {};
            res[i] = (scc.find(i)<scc.find(i+N));
        }
        return res;
    }
};


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vec<int> S(N),T(N),U(N);
    for(auto& x:S) cin >> x;
    for(auto& x:T) cin >> x;
    for(auto& x:U) cin >> x;
    auto id = [&](int x,int y){
        return x*N+y;
    };

    SAT satashun(N*N);
    for(int i=0;i<N;i++){
        S[i]--,T[i]--;
        for(int j=0;j<N;j++){
            satashun.add_closure(id(S[i],j),id(j,T[i]),U[i]%2==0,U[i]/2==0);
        }
    }
    auto res = satashun.solve();
    if(res.empty()){
        cout << -1 << "\n";
    }else{
        for(int i=0;i<N;i++) for(int j=0;j<N;j++){
            cout << res[id(i,j)] << (j!=N-1? " ":"\n");
        }
    }
}