#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n;
char S[4005][4005];
int a[4005],b[4005];
int ans[4005][4005];
pii P[4005];

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&n);
	rep(i,1,n) scanf("%s",S[i] + 1);
	rep(i,1,n) scanf("%d",&a[i]);
	rep(i,1,n) scanf("%d",&b[i]);
	rep(i,1,n){
		rep(j,1,n){
			if(S[i][j] == '-'){
				a[i]++;
				b[j]++;
			}
		}		
	}
//	rep(i,1,n) printf("%d ",a[i]);
//	printf("\n");
//	rep(i,1,n) printf("%d ",b[i]);
//	printf("\n");	
	rep(i,1,n){
		if(a[i] < 0 || a[i] > n){
			printf("NO\n");
			return 0;
		}
		if(b[i] < 0 || b[i] > n){
			printf("NO\n");
			return 0;
		}
	}
	rep(i,1,n){
		if(!a[i]) continue;
		rep(j,1,n) P[j] = mkp(-b[j],j);
		nth_element(P + 1,P + a[i],P + n + 1);
		rep(j,1,a[i]){
			ans[i][P[j].second] = 1;
			b[P[j].second]--;
//			printf("%d %d ",P[j].first,P[j].second);
		}
//		printf("\n");
	}
	rep(i,1,n){
		if(b[i]){
			printf("NO\n");
			return 0;
		}
	}
	printf("YES\n");
	rep(i,1,n){
		rep(j,1,n){
			if(S[i][j] == '-') printf("%d",ans[i][j] ^ 1);
			else printf("%d",ans[i][j]);
		}
		printf("\n");
	}
	return 0;
}