#include <bits/stdc++.h>
using namespace std;
const int N = 4e3 + 5;
int n;
char s[N][N];
int X[N],Y[N],srow[N],scol[N],usd[N][N];
char ans[N][N];
inline void Choose(int x,int y) {
	usd[x][y] = true;
	X[x]--;Y[y]--;ans[x][y] = s[x][y] == '+' ? '1' : '0';
}
int srtx[N],srty[N];
int main() {
	cin >> n;
	for(int i = 1;i <= n;i++) cin >> (s[i] + 1);
	for(int i = 1;i <= n;i++) cin >> X[i];
	for(int i = 1;i <= n;i++) cin >> Y[i];
	int sm = 0;
	for(int i = 1;i <= n;i++) sm += X[i] - Y[i];
	if(sm) return puts("NO"),0;
	for(int i = 1;i <= n;i++)
		for(int j = 1;j <= n;j++)
			if(s[i][j] == '-') srow[i]++,scol[j]++;
	for(int i = 1;i <= n;i++) X[i] += srow[i],Y[i] += scol[i],srtx[i] = i;
	for(int i = 1;i <= n;i++)
		if(X[i] < 0 || Y[i] < 0 || X[i] > n || Y[i] > n) return puts("NO"),0;
	// for(int i = 1;i <= n;i++) printf("(%d,%d)\n",X[i],Y[i]);
	sort(srtx + 1,srtx + n + 1,[&](const int &a,const int &b) { return X[a] > X[b];});
	for(int i = 1;i <= n;i++) {
		int u = srtx[i];//printf("u:%d,%d\n",u,X[u]);
		for(int j = 1;j <= n;j++) srty[j] = j;
		nth_element(srty + 1,srty + X[u],srty + n + 1,[&](const int &a,const int &b) { return Y[a] > Y[b];});
		for(int j = 1;X[u] > 0;j++) {
			if(!Y[srty[j]]) return puts("NO"),0;
			else Choose(u,srty[j]);
		} 
			
	}
	for(int i = 1;i <= n;i++) for(int j = 1;j <= n;j++) if(!usd[i][j]) ans[i][j] = (s[i][j] == '+') ? '0' : '1';
	puts("Yes");
	for(int i = 1;i <= n;i++) cout << (ans[i] + 1) << endl;
	return 0;
}