#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define endl '\n'
#define lowbit(x) (x)&(-x)
#define pii pair<int,int>
#define pb push_back
#define all(s) s.begin(), s.end()
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
#define here system("pause")
using namespace std;
template <class T> inline void read(T& x) { x = 0; char c = getchar(); bool f = 0; for (; !isdigit(c); c = getchar()) f ^= (c == '-'); for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48); x = f ? -x : x; }
template <class T> inline void write(T x) { if (x < 0) putchar('-'), x = -x; if (x < 10) putchar(x + 48); else write(x / 10), putchar(x % 10 + 48); }
template<typename T> void chkmin(T& lhs, const T& rhs) { lhs = lhs > rhs ? rhs : lhs; }
template<typename T> void chkmax(T& lhs, const T& rhs) { lhs = lhs < rhs ? rhs : lhs; }

const int N = 4e3+5;
const int mod = 1e9+7;
const int INF = 8e18+7;
const double eps = 1e-6;
inline int pow(int a, int b, int p){ int res = 1%p; while(b){ if(b&1) res=res*a%p; a=a*a%p, b>>=1;} return res;}
inline int inv(int a, int p){ return pow(a,p-2,p)%p;}
mt19937_64 rnd(chrono::duration_cast< chrono::nanoseconds>(chrono::system_clock::now().time_since_epoch()).count());
int randint(int L, int R) {
	uniform_int_distribution<int> dist(L, R);
	return dist(rnd);
}
using ull = unsigned long long;

int n;
int a[N][N];
int R[N], C[N];
int vis[N][N];

inline void select(int i, int j){
	vis[i][j] ^= 1;
	R[i] += a[i][j];
	C[j] += a[i][j];
	a[i][j] = -a[i][j];
}

inline void sol(){
	cin >> n;
	for(int i=1;i<=n;i++){
		string s;
		cin >> s;
		for(int j=0;j<n;j++){
			a[i][j+1] = s[j] == '+' ? 1 : -1;
		}
	}
	
	for(int i=1;i<=n;i++){
		cin >> R[i];
		R[i] = -R[i];
	}
	for(int i=1;i<=n;i++){
		cin >> C[i];
		C[i] = -C[i];
	}
	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(a[i][j] == 1){
				select(i, j);
			}
		}
	}
	
	for(int i=1;i<=n;i++){
		if(R[i] < 0 || C[i] < 0) return cout << "No\n", void();
	}
	
	vector<int> r(n), c(n);
	iota(all(r), 1);
	iota(all(c), 1);
	sort(all(r), [&](const int &a, const int &b){
		return R[a] > R[b];
	});
	for(int x : r){
		sort(all(c), [&](const int &a, const int &b){
			return C[a] > C[b];
		});
		for(int y : c){
			if(R[x] <= 0) break;
			if(C[y] > 0) select(x, y);
		}
	}
	
	for(int i=1;i<=n;i++){
		if(R[i] || C[i]) return cout << "No\n", void();
	}
	
	cout << "Yes\n";
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cout << vis[i][j];
		}
		cout << endl;
	}
}


signed main(){
#ifdef LOCAL
	clock_t CLOCK_S = clock();
	freopen("1.in", "r", stdin);
#endif
	IOS;
	int tc = 1;
//	cin >> tc;
	while(tc--){
		sol();
	}
#ifdef LOCAL
	clock_t CLOCK_E = clock();
	cerr << "Judging Time: " << 1.00 * (CLOCK_E - CLOCK_S) / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}