#include<bits/stdc++.h>
using namespace std;
constexpr int M=4005;
int n,sum,r[M],c[M],pos[M];
bool a[M][M];string str[M];
bool cmp(int x,int y){return c[x]>c[y];}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin>>n;
	for (int i=1;i<=n;i++)
		cin>>str[i],str[i]=" "+str[i];
	for (int i=1;i<=n;i++) cin>>r[i];
	for (int i=1;i<=n;i++) cin>>c[i];
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			if (str[i][j]=='-')
				r[i]++,c[j]++;
	for (int i=1;i<=n;i++) sum+=r[i]-c[i];
	if (sum) return puts("No"),0;
    iota(pos,pos+n+1,0);
    sort(pos+1,pos+n+1,cmp);
	for (int i=1;i<=n;i++){
		for (int j=1;j<=r[i];j++)
            if (c[pos[j]]) a[i][pos[j]]=1,c[pos[j]]--;
            else return puts("No"),0;
        inplace_merge(pos+1,pos+r[i]+1,pos+n+1,cmp);
	} puts("Yes");
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++)
			putchar((a[i][j]^(str[i][j]=='-'))?'1':'0');
		puts("");
	}
	return 0;
}