#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
void tostr(ll x,string& res){while(x)res+=('0'+(x%10)),x/=10; reverse(ALL(res)); return;}
template<class T> inline bool chmax(T& a,T b){ if(a<b){a=b;return 1;}return 0; }
template<class T> inline bool chmin(T& a,T b){ if(a>b){a=b;return 1;}return 0; }
//template end

vector<int> g[1010000]; int res[1010000]={},c=0;
stack<int> s; bool used[1010000]={};
vector<int> low,val; int idx=0;
void dfs(int v){
   low[v]=val[v]=++idx; s.push(v); used[v]=1;
   for(int to:g[v]){
      if(val[to]==0){dfs(to); chmin(low[v],low[to]);}
      else if(used[to])chmin(low[v],val[to]);
   }
   if(low[v]==val[v]){ c++;
      while(1){
         int to=s.top(); s.pop();
         used[to]=0; res[to]=c;
         if(v==to)break;
      }
   }
}
void scc(int n){
   low.resize(2*n+1,0); val.resize(2*n+1,0);
   rep(i,0,2*n+1)if(i!=n&&val[i]==0)dfs(i);
}

int main(){
  int N,n;
  scanf("%d",&N);
  n=N*N;
  int S[N];
  int T[N];
  int U[N];
  int mat[N][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];
  }
  for (int i=0;i<N;++i) {
    cin>>U[i];
  }

  for (int i=0;i<N;++i) {
    for (int j=0;j<N;++j) {
      int a=S[i]+j*N+1;
      int b=j+T[i]*N+1;
      if (U[i]==0) {
      } else if (U[i]==1) {
        a*=-1;
      } else if (U[i]==2) {
        b*=-1;
        a=b;
      } else if (U[i]==3) {
        a*=-1;
        b*=-1;
      }
      g[n-a].push_back(n+b); g[n-b].push_back(n+a);
    }
  }
  scc(n);
  vector<int> buf(n+1);
  rep(i,0,n){
    if(res[i]==res[2*n-i]){
      std::cout<<-1<<std::endl;
      return 0;
    }
    buf[n-i]=(res[i]<res[2*n-i]?i-n:n-i);
  }
  rep(i,1,n+1) {
    int id=i-1;
    mat[id%N][id/N]=buf[i]<0?0:1;
  }
  for (int i=0;i<N;++i) {
    for (int j=0;j<N;++j) {
      std::cout<<mat[i][j];
      if (j==N-1) {
        std::cout<<"\n";
      } else {
        std::cout<<" ";
      }
    }
  }
  return 0;
}