package contest200612; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] S = na(n); int[] T = na(n); int[] U = na(n); TwoSatisfiability ts = new TwoSatisfiability(n*n); for(int i = 0;i < n;i++){ for(int j = 0;j < n;j++){ ts.or((S[i]-1)*n+j, (U[i]&1) == 1, j*n+T[i]-1, (U[i]&2) == 2); } } if(ts.isSatisfied()){ int[] res = ts.restore(); for(int i = 0;i < n;i++){ for(int j = 0;j < n;j++){ out.print((res[i*n+j] == 1 ? 1 : 0) + " "); } out.println(); } }else{ out.println(-1); } } public static class TwoSatisfiability { public int[] from, to; public int p; public int n; public TwoSatisfiability(int n) { this.n = n; from = new int[2]; to = new int[2]; p = 0; } private void addEdge(int x, int y) { if(p == from.length){ from = Arrays.copyOf(from, p*3/2); to = Arrays.copyOf(to, p*3/2); } from[p] = x; to[p] = y; p++; } public boolean isSatisfied() { int[][] g = packD(2*n, from, to, p); int[] clus = decomposeToSCC(g); for(int i = 0;i < n;i++){ if(clus[i] == clus[i+n])return false; } return true; } public int[] restore() { int[][] g = packD(2*n, from, to, p); int[] clus = decomposeToSCC(g); int[] ret = new int[n]; for(int i = 0;i < n;i++){ if(clus[i] == clus[i+n])return null; // unsatisfied ret[i] = clus[i] > clus[i+n] ? -1 : 1; } return ret; } // x or y // ~x->y, ~y->x public void or(int x, int y) { addEdge(x+n, y); addEdge(y+n, x); } public void or(int x, boolean positivex, int y, boolean positivey) { addEdge(x+(positivex ? n : 0), y+(positivey ? 0 : n)); addEdge(y+(positivey ? n : 0), x+(positivex ? 0 : n)); } // x = y // ~x -> ~y, ~y -> ~x // x -> y, y -> x public void eq(int x, int y) { addEdge(x, y); addEdge(y, x); addEdge(x+n, y+n); addEdge(y+n, x+n); } public void eq(int x, boolean positivex, int y, boolean positivey) { addEdge(x+(positivex ? 0 : n), y+(positivey ? 0 : n)); addEdge(y+(positivey ? 0 : n), x+(positivex ? 0 : n)); addEdge(x+(positivex ? n : 0), y+(positivey ? n : 0)); addEdge(y+(positivey ? n : 0), x+(positivex ? n : 0)); } // x xor y // ~x -> y, y -> ~x // x -> ~y, ~y -> x public void xor(int x, int y) { addEdge(x+n, y); addEdge(y, x+n); addEdge(x, y+n); addEdge(y+n, x); } // always true public void t(int x) { addEdge(x+n, x); } // always false public void f(int x) { addEdge(x, x+n); } ////// inner utility public static int[][] packD(int n, int[] from, int[] to, int sup) { int[][] g = new int[n][]; int[] p = new int[n]; for(int i = 0;i < sup;i++)p[from[i]]++; for(int i = 0;i < n;i++)g[i] = new int[p[i]]; for(int i = 0;i < sup;i++){ g[from[i]][--p[from[i]]] = to[i]; } return g; } public static int[] decomposeToSCC(int[][] g) { int n = g.length; int[] stack = new int[n+1]; int[] ind = new int[n+1]; int[] ord = new int[n]; Arrays.fill(ord, -1); int[] low = new int[n]; Arrays.fill(low, -1); int sp = 0; int id = 0; // preorder int[] clus = new int[n]; int cid = 0; int[] cstack = new int[n+1]; int csp = 0; boolean[] incstack = new boolean[n]; for(int i = 0;i < n;i++){ if(ord[i] == -1){ ind[sp] = 0; cstack[csp++] = i; stack[sp++] = i; incstack[i] = true; while(sp > 0){ int cur = stack[sp-1]; if(ind[sp-1] == 0){ ord[cur] = low[cur] = id++; } if(ind[sp-1] < g[cur].length){ int nex = g[cur][ind[sp-1]]; if(ord[nex] == -1){ ind[sp-1]++; ind[sp] = 0; incstack[nex] = true; cstack[csp++] = nex; stack[sp++] = nex; }else{ // shortcut // U.tr(cur, nex, incstack[nex], low[nex], stack); if(incstack[nex])low[cur] = Math.min(low[cur], low[nex]); ind[sp-1]++; } }else{ if(ord[cur] == low[cur]){ while(csp > 0){ incstack[cstack[csp-1]] = false; clus[cstack[--csp]] = cid; if(cstack[csp] == cur)break; } cid++; } if(--sp >= 1)low[stack[sp-1]] = Math.min(low[stack[sp-1]], low[stack[sp]]); } } } } return clus; } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }