#include <bits/stdc++.h>

using namespace std;

using ll = long long;

constexpr char newl = '\n';

class StronglyConnectedComponents {
private:
    void dfs(int v, vector<int>& used) {
        used[v] = true;
        for (int i = 0; i < G[v].size(); i++) {
            if (!used[G[v][i]]) dfs(G[v][i], used);
        }
        vs.push_back(v);
    }

    void rdfs(int v, int k, vector<int>& used) {
        used[v] = true;
        cmp[v] = k;
        for (int i = 0; i < rG[v].size(); i++) {
            if (!used[rG[v][i]]) rdfs(rG[v][i], k, used);
        }
    }

public:
    int V;
    vector< vector<int> > G, rG;
    vector<int> vs;
    vector<int> cmp;

    StronglyConnectedComponents(int n) : V(n), G(n), rG(n), cmp(n, -1) {}

    void add_edge(int from, int to) {
        G[from].push_back(to);
        rG[to].push_back(from);
    }

    int run() {
        vector<int> used(V, false);
        vs.clear();
        for (int v = 0; v < V; v++) {
            if (!used[v]) dfs(v, used);
        }
        used.assign(V, false);
        int k = 0;
        for (int i = (int)vs.size() - 1; i >= 0; i--) {
            if (!used[vs[i]]) rdfs(vs[i], k++, used);
        }
        return k;
    }
};

// [Depends]: StronglyConnectedComponents
struct TwoSAT {
    int literal_num;
    StronglyConnectedComponents scc;

    TwoSAT(int V) : literal_num(V), scc(2 * V) {}

    // x, y: index
    // flag_x, flag_y: literal's value
    void add(int x, bool flag_x, int y, bool flag_y) noexcept {
        scc.add_edge(x + literal_num * flag_x, y + literal_num * !flag_y);
        scc.add_edge(y + literal_num * flag_y, x + literal_num * !flag_x);
    }

    bool run() noexcept {
        scc.run();
        return satisfy();
    }

    bool satisfy() noexcept {
        for (int i = 0; i < literal_num; i++) {
            if (scc.cmp[i] == scc.cmp[i + literal_num]) return false;
        }
        return true;
    }

    vector<int> dump() noexcept {
        vector<int> res(literal_num);
        for (int i = 0; i < literal_num; i++) {
            res[i] = scc.cmp[i] > scc.cmp[i + literal_num];
        }
        return res;
    }
};

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

    int n;
    cin >> n;

    vector<int> s(n), t(n), u(n);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
        --s[i];
    }

    for (int i = 0; i < n; i++) {
        cin >> t[i];
        --t[i];
    }

    TwoSAT sat(n * n);
    for (int i = 0; i < n; i++) {
        cin >> u[i];
        bool f0 = !(u[i] & 1);
        bool f1 = !(u[i] >> 1 & 1);

        for (int j = 0; j < n; j++) {
            sat.add(s[i] * n + j, f0, j * n + t[i], f1);
        }
    }

    if (!sat.run()) {
        cout << -1 << newl;
        return 0;
    }

    vector<int> res = sat.dump();

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << res[i * n + j] << " \n"[j + 1 == n];
        }
    }

    return 0;
}