#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;

class StronglyConnectedComponents {
   public:
    StronglyConnectedComponents(vector<vector<int>> &G) {
        vector<int> postorder;
        vector<bool> visited(G.size());
        for (int i = 0; i < (int)G.size(); i++) {
            if (visited[i]) continue;
            dfs(G, visited, postorder, i);
        }

        rg.resize(G.size());
        for (int i = 0; i < (int)G.size(); i++) {
            for (auto g : G[i]) rg[g].push_back(i);
        }

        c = 0;
        _id.resize(G.size(), 0);
        for (int i = (int)G.size() - 1; i >= 0; i--) {
            if (_id[postorder[i]]) continue;
            vector<int> components;
            rdfs(rg, components, postorder[i], ++c);
            scc.push_back(components);
        }
    }

    int size() {
        return c;
    }

    int id(int u) {
        return _id[u];
    }

    bool same(int u, int v) {
        return _id[u] == _id[v];
    }

    vector<vector<int>> reverseGraph() {
        return rg;
    }

    vector<vector<int>> getComponents() {
        return scc;
    }
   
   private:
    int c;
    vector<int> _id;
    vector<vector<int>> rg, scc;

    void dfs(vector<vector<int>> &G, vector<bool> &visited, vector<int> &postorder, int v) {
        visited[v] = true;
        for (auto g : G[v]) {
            if (visited[g]) continue;
            dfs(G, visited, postorder, g);
        }
        postorder.push_back(v);
    }

    void rdfs(vector<vector<int>> &G, vector<int> &components, int v, int c) {
        _id[v] = c; components.push_back(v);
        for (auto g : G[v]) {
            if (_id[g]) continue;
            rdfs(G, components, g, c);
        }
    }
};

class TwoSat {
   private:
    const int sz;
    vector<int> b;
    vector<vector<int>> G;
    StronglyConnectedComponents *scc;

   public:
    TwoSat(int n) : sz(n), b(sz), G(2 * sz) {}

    void addEdge(int u, bool notu, int v, bool notv) {
        int u0 = notu ? u + sz : u;
        int u1 = notu ? u : u + sz;
        int v0 = notv ? v + sz : v;
        int v1 = notv ? v : v + sz;
        G[u1].push_back(v0);
        G[v1].push_back(u0);
    }

    bool isSatisfiable() {
        scc = new StronglyConnectedComponents(G);
        for (int i = 0; i < sz; i++) {
            if (scc->same(i, i + sz)) return false;
        } 
        return true;
    }

    vector<int> & assign() {
        for (int i = 0; i < sz; i++) {
            b[i] = scc->id(i) > scc->id(i + sz);
        }
        return b;
    }

};

int main() {
    int N; cin >> N;
    vector<int> S(N), T(N), U(N);
    for (auto &v : S) cin >> v;
    for (auto &v : T) cin >> v;
    for (auto &v : U) cin >> v;

    vector<vector<int>> SI(N);
    REP(i, 0, N) SI[S[i] - 1].push_back(i);

    auto decode = [N](int v) -> pair<int, int> {
        return {v / N, v % N};
    };

    auto encode = [N](int x, int y) -> int {
        return x * N + y;
    };

    TwoSat ts(N * N);

    REP(i, 0, N * N) {
        auto [x, y] = decode(i);
        for (auto &j : SI[x]) {
            int k = encode(y, T[j] - 1);
            if (U[j] == 0) {
                ts.addEdge(i, false, k, false);
            } else if (U[j] == 1) {
                ts.addEdge(i, true, k, false);
            } else if (U[j] == 2) {
                ts.addEdge(i, false, k, true);
            } else if (U[j] == 3) {
                ts.addEdge(i, true, k, true);
            }
        }
    }

    if (!ts.isSatisfiable()) {
        cout << -1 << endl;
        return 0;
    }

    auto assigned = ts.assign();
    REP(i, 0, N) {
        REP(j, 0, N) {
            if (assigned[encode(i, j)]) cout << 1 << " ";
            else cout << 0 << " ";
        }
        cout << endl;
    }

    return 0;
}