#include<bits/stdc++.h>
using namespace std;
const int N=4e3+10,V=N*2,E=N*N*2,INF=1e9;
int n,p[N],q[N],w[N][N];
char a[N][N];
struct edges{
	int to,c,nex;
}edge[100001];
int kk=1,s,t,head[V],cur[V],d[V];
void add(int u,int v,int c){
	// cerr<<u<<' '<<v<<' '<<c<<endl;
	edge[++kk]={v,c,head[u]},head[u]=kk;
	edge[++kk]={u,0,head[v]},head[v]=kk;
}
int pos[V];
bool bfs(){
	queue<int>q;
	copy(head+s,head+1+t,cur+s);
	fill(d+s,d+1+t,-1);
	d[s]=0,q.push(s);
	for(int i=1;i<=n;i++)pos[i]=n+1,pos[i+n]=1;
	for(int u;!q.empty();){
		u=q.front(),q.pop();
		for(int i=head[u];i;i=edge[i].nex){
			int v=edge[i].to;
			if(edge[i].c&&d[v]==-1)d[v]=d[u]+1,q.push(v);
		}
		if(u>=1&&u<=n){
			for(int v=n+1;v<=n+n;v++)if(w[u][v-n]){
				if(d[v]==-1)d[v]=d[u]+1,q.push(v);
			}
		}
		if(u>n&&u<=n+n){
			for(int v=1;v<=n;v++)if(!w[v][u-n]){
				if(d[v]==-1)d[v]=d[u]+1,q.push(v);
			}
		}
	}
	return d[t]!=-1;
}
int dfs(int u,int lim=INF){
	if(u==t)return lim;
	int flow=0;
	for(int i=cur[u];i&&flow<lim;i=edge[i].nex){
		cur[u]=i;
		int v=edge[i].to;
		if(d[v]!=d[u]+1||!edge[i].c)continue;
		int f=dfs(v,min(lim-flow,edge[i].c));
		if(!f)d[v]=-1;
		edge[i].c-=f,edge[i^1].c+=f,flow+=f;
	}
	if(u>=1&&u<=n){
		for(int v=pos[u];v<=n+n&&flow<lim;v++){
			pos[u]=v;
			if(d[v]!=d[u]+1||!w[u][v-n])continue;
			int f=dfs(v,1);
			if(!f)d[v]=-1;
			w[u][v-n]^=f,flow+=f;
		}
	}
	if(u>n&&u<=n+n){
		for(int v=pos[u];v<=n&&flow<lim;v++){
			pos[u]=v;
			if(d[v]!=d[u]+1||w[v][u-n])continue;
			int f=dfs(v,1);
			if(!f)d[v]=-1;
			w[v][u-n]^=f,flow+=f;
		}
	}
	return flow;
}
int dinic(){
	int flow=0;
	for(;bfs();)flow+=dfs(s);
	return flow;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%s",a[i]+1);
	}
	s=0,t=n+n+1;
	int sum=0;
	for(int i=1;i<=n;i++){
		scanf("%d",&p[i]);
		if(p[i]>0){
			sum+=p[i],add(s,i,p[i]);
		}else{
			add(i,t,-p[i]);
		}
	}
	for(int i=1;i<=n;i++){
		scanf("%d",&q[i]);
		if(q[i]>0){
			add(i+n,t,q[i]);
		}else{
			sum+=-q[i];
			add(s,i+n,-q[i]);
		}
	}
	if(accumulate(p+1,p+1+n,0)!=accumulate(q+1,q+1+n,0))puts("No"),exit(0);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(a[i][j]=='+')w[i][j]=1;
			else w[i][j]=0;
		}
	}
	int res=dinic();
	if(res!=sum)puts("No"),exit(0);
	puts("Yes");
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			putchar("01"[w[i][j]!=(a[i][j]=='+')]);
		}
		puts("");
	}
	// for(int u=s;u<=t;u++){
	// 	for(int i=head[u];i;i=edge[i].nex){
	// 		if(i%2==0&&edge[i^1].c)fprintf(stderr,"%d %d %d\n",u,edge[i].to,edge[i^1].c);
	// 	}
	// }
	return 0;
}