#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int N=5e3+5;
int T;
inline int read(){
	int al=0,fh=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
	if(ch=='-')
	fh=-1;
	ch=getchar();
	}
	while(ch<='9'&&ch>='0'){
	al=al*10+ch-'0';
	ch=getchar();
	}
	return al*fh;
}
int n,a[N],cho[N][N];
char str[N][N];
struct node
{
	int i,z;
}b[N];
bool cmp(node a,node b){
	return a.z>b.z;
}
signed main(){
	n=read();
	for(int i=0;i<n;i++){
		scanf("%s",str[i]);
	}
	for(int i=1;i<=n;i++){
		a[i]=read();
	}
	for(int i=1;i<=n;i++){
		b[i].z=read();
		b[i].i=i;
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(str[i][j]=='-'){
				a[i+1]++;
				b[j+1].z++;
			}
				
		}
	}
	int ok=1;
	for(int i=1;i<=n;i++){
		sort(b+1,b+n+1,cmp);
		for(int j=1;j<=min(a[i],n);j++){
			b[j].z--;
			if(b[j].z<0)
				ok=0;
			cho[i][b[j].i]=1;
		}
	}
	for(int i=1;i<=n;i++){
		if(b[i].z!=0)
			ok=0;
	}
	if(ok==0){
		cout<<"No";
	}
	else {
		cout<<"Yes\n";
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				if((cho[i+1][j+1]==1&&str[i][j]=='+')||(cho[i+1][j+1]==0&&str[i][j]=='-'))
					cout<<1;
				else cout<<0;
			}
			cout<<endl;
		}
	}
}