#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#define chmax(a,b) a = max(a,b)
#define chmin(a,b) a = min(a,b)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 3
#else
#define SIZE 555
#endif

int N,S[SIZE],T[SIZE],U[SIZE];
int M[SIZE][SIZE],C[SIZE][SIZE];
int NEW=2;

bool check() {
    REP(i,N)REP(j,N) {
        int v = M[S[i]][j] + M[j][T[i]]*2;
        if (v == U[i]) {
            return false;
        }
    }
    return true;
}

void solve() {
    cin>>N;
    REP(i,N){cin>>S[i];S[i]--;}
    REP(i,N){cin>>T[i];T[i]--;}
    REP(i,N)cin>>U[i];
    REP(i,SIZE)REP(j,SIZE)M[i][j]=0;
    REP(_,1000) {
        REP(i,N)REP(j,N) {
            int v = M[S[i]][j] + M[j][T[i]]*2;
            if (v == U[i]) {
                if (rand() % 2) {
                    M[S[i]][j] = !M[S[i]][j];
                } else {
                    M[j][T[i]] = !M[j][T[i]];
                }
            }
        }
        if (check()) {
            REP(i,N) {
                REP(j,N) out("%lld ", M[i][j]);
                out("\n");
            }
            return;
        }
    }
    cout << -1 << endl;
}