//Shirasu Azusa 2024.5
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;  
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=5005;
int n,x[N],y[N],b[N][N];
char s[N];

signed main() {
	n=read();
	rep(i,1,n) {
		scanf("%s",s+1);
		rep(j,1,n) if(s[j]=='-') {
			b[i][j]=1; x[i]--, y[j]--;
		}
	}
	rep(i,1,n) x[i]=read()-x[i];
	rep(i,1,n) y[i]=read()-y[i];
	rep(i,1,n) if(x[i]<0||x[i]>n||y[i]<0||y[i]>n) return puts("No"), 0;
	rep(i,1,n) {
		static pii p[N];
		rep(i,1,n) p[i]=pii(y[i],i);
		sort(p+1,p+n+1,greater<pii>());
		rep(j,1,x[i]) {
			int u=p[j].se; b[i][u]^=1, y[u]--;
		}
	}
	rep(i,1,n) if(y[i]) return puts("No"), 0;
	puts("Yes");
	rep(i,1,n) {
		rep(j,1,n) putchar('0'+b[i][j]); puts("");
	}
	return 0;
}