#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000005

struct scc{
	vector<int> new_ind;
	vector<vector<int>> new_E;
	vector<vector<int>> E;
	vector<vector<int>> E_rev;
	int sz;
	
	scc(vector<vector<int>> &e){
		E = e;
		E_rev.resize(e.size(),vector<int>());
		for(int i=0;i<e.size();i++){
			for(int j=0;j<e[i].size();j++){
				E_rev[e[i][j]].push_back(i);
			}
		}
		
		vector<bool> checked(E.size(),false);
		vector<int> arrange;
		for(int i=0;i<E.size();i++){
			if(checked[i])continue;
			stack<int> S;
			S.push(i);
			while(S.size()!=0){
				int from = S.top();
				S.pop();
				if(from<0){
					arrange.push_back(-from-1);
					continue;
				}
				if(checked[from])continue;
				checked[from]=true;
				S.push(-from-1);
				for(int j=0;j<E[from].size();j++){
					S.push(E[from][j]);
				}
			}
		}
		
		reverse(arrange.begin(),arrange.end());
		new_ind.resize(E.size(),-1);
		sz = 0;
		
		for(int i=0;i<arrange.size();i++){
			int start = arrange[i];
			if(new_ind[start]!=-1)continue;
			queue<int> Q;
			Q.push(start);
			while(Q.size()!=0){
				int from = Q.front();
				Q.pop();
				if(new_ind[from]!=-1)continue;
				new_ind[from]=sz;
				for(int j=0;j<E_rev[from].size();j++){
					int to = E_rev[from][j];
					Q.push(to);
				}
			}
			sz++;
		}
		
		new_E.resize(sz,vector<int>());
		for(int i=0;i<E.size();i++){
			for(int j=0;j<E[i].size();j++){
				int a = new_ind[i];
				int b = new_ind[E[i][j]];
				new_E[a].push_back(b);
			}
		}
	}
	
};

bool check(vector<vector<int>> ans,vector<int> S,vector<int> T,vector<int> U){
	for(int i=0;i<S.size();i++){
		for(int j=0;j<S.size();j++){
			int t = ans[S[i]][j] + ans[j][T[i]] * 2;
			if(t==U[i])return false;
		}
	}
	return true;
}

int main(){
	
	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]--;
	}
	for(int i=0;i<N;i++){
		cin>>U[i];
	}
	
	vector<vector<int>> E(N*N*2,vector<int>());
	
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			int a = S[i]*N + j;
			int b = j*N + T[i];
			a*=2,b*=2;
			for(int x=0;x<2;x++){
				for(int y=0;y<2;y++){
					if(x+y*2==U[i]){
						E[a+x].push_back(b+(y^1));
						E[b+y].push_back(a+(x^1));
					}
				}
			}
		}
	}
	
	
	
	scc SCC(E);
	
	E = SCC.new_E;
	
	vector<int> X(E.size(),0);
	for(int i=0;i<E.size();i++){
		for(int j=0;j<E[i].size();j++){
			//cout<<E[i][j]<<endl;
			if(i==E[i][j])continue;
			X[E[i][j]]++;
		}
	}
	queue<int> Q;
	for(int i=0;i<X.size();i++){
		if(X[i]==0)Q.push(i);
	}
	
	vector<int> ind;
	
	while(Q.size()!=0){
		int u = Q.front();
		Q.pop();
		ind.push_back(u);
		for(int i=0;i<E[u].size();i++){
			int v = E[u][i];
			X[v]--;
			if(X[v]==0){
				Q.push(v);
			}
		}
	}
	
	//for(int i=0;i<X.size();i++)cout<<X[i]<<endl;

	map<int,int> mp;
	for(int i=0;i<ind.size();i++){
	//	cout<<ind[i]<<endl;
		mp[ind[i]] = i;
	}
	

	vector<vector<int>> ans(N,vector<int>(N,0));
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			int t = i*N + j;
			t *= 2;
			int u = SCC.new_ind[t];
			int v = SCC.new_ind[t+1];
			if(u==v){
				cout<<-1<<endl;
				return 0;
			}
			if(mp[u]>mp[v]){
				ans[i][j]=0;
			}
			else{
				ans[i][j]=1;
			}
		}
	}
	
	//cout<<check(ans,S,T,U)<<endl;
	
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			if(j!=0)cout<<' ';
			cout<<ans[i][j];
		}
		cout<<endl;
	}
	
	return 0;
}