#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 4000
using namespace std;
int read()
{
	char c=0;
	int sum=0,f=1;
	while (c!='-'&&(c<'0'||c>'9')) c=getchar();
	if (c=='-') c=getchar(),f=-1;
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum*f;
}
int n,a[N+1],b[N+1],p[N+1];
char c[N+1][N+1];
bool used[N+1][N+1];
bool cmp(int x,int y)
{
	return b[x]>b[y];
}
int main()
{
	int res=0;
	n=read();
	for (int i=1;i<=n;++i)
		for (int j=1;j<=n;++j)
			cin>>c[i][j];
	for (int i=1;i<=n;++i) a[i]=read();
	for (int i=1;i<=n;++i) b[i]=read();
	for (int i=1;i<=n;++i)
		for (int j=1;j<=n;++j)
			if (c[i][j]=='-')
				a[i]++,b[j]++,used[i][j]=1;
	for (int i=1;i<=n;++i)
		if (a[i]<0||b[i]<0||a[i]>n||b[i]>n)
		{
			puts("No");
			return 0;
		}
	for (int i=1;i<=n;++i) res+=a[i]-b[i];
	if (res!=0)
	{
		puts("No");
		return 0;
	}
	for (int i=1;i<=n;++i) p[i]=i;
	for (int i=1;i<=n;++i)
	{
		sort(p+1,p+n+1,cmp);
		for (int j=1;j<=a[i];++j)
		{
			b[p[j]]--,used[i][p[j]]^=1;
			if (b[p[j]]<0)
			{
				puts("No");
				return 0;
			}
		}
	}
	puts("Yes");
	for (int i=1;i<=n;++i)
	{
		for (int j=1;j<=n;++j) printf("%d",used[i][j]);
		puts("");
	}
	return 0;
}