#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 998244353;
int sign(int a){ return (a&1) ? (Mod-1) : 1; }
void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 10010;
int fact[fN], invfact[fN], inv[fN];
void initfact(int n){
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

int n;
string s[4040];
int r[4040], c[4040], ans[4040][4040];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	rep(i, n) cin >> s[i];
	rep(i, n) cin >> r[i];
	rep(i, n) cin >> c[i];

	rep(i, n) rep(j, n){
		if(s[i][j] == '-') ans[i][j] = 1, ++r[i], ++c[j];
	}

	//rep(i, n){ cout << r[i] << " "; } cout << "\n";
	//rep(i, n){ cout << c[i] << " "; } cout << "\n";

	int ss = 0;
	rep(i, n){ 
		if(r[i] < 0 || r[i] > n || c[i] < 0 || c[i] > n){ ss = -1; break; }
		ss += r[i] - c[i];
	}
	//cout << ss << "\n";
	if(ss != 0) return cout << "No\n", 0;

	priority_queue< pii > pq;
	rep(i, n) pq.push(make_pair(c[i], i));
	static int ord[4040];
	rep(i, n) ord[i] = i;
	sort(ord, ord + n, [&](int lh, int rh){ return r[lh] > r[rh]; });
	rep(_i, n){
		int i = ord[_i];
		static int tmp[4040]; int p = 0;
		rep(j, r[i]){
			pii cur = pq.top(); pq.pop();
			int t = cur.second;
			if(c[t] <= 0) return cout << "No\n", 0;
			tmp[p++] = t;
			//cout << " " << i << " " << t << "\n";
			ans[i][t] ^= 1, --c[t];
		}
		rep(j, p) pq.push(make_pair(c[tmp[j]], tmp[j]));
	}

	cout << "Yes\n";
	string res;
	res.resize(n);
	rep(i, n){
		rep(j, n) res[j] = (char)('0' + ans[i][j]);
		cout << res << "\n";
	}

	return 0;
}