#include<bits/stdc++.h>
using namespace std;
const int maxn = 4005;
int n, pr[maxn], pc[maxn], sr[maxn], sc[maxn], flg[maxn][maxn];
char s[maxn][maxn];
struct Node {
	int sub, id;
	Node(int sub = 0, int id = 0) : sub(sub), id(id) {}
	bool operator < (const Node &rhs) const {
		return sub == rhs.sub ? id < rhs.id : sub < rhs.sub;
	}
};
priority_queue<Node> row, col;
vector<Node> v;
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++ i) {
		scanf("%s", s[i] + 1);
		for(int j = 1; j <= n; ++ j) {
			if(s[i][j] == '+') {
				++ pr[i];
				++ pc[j];
			}
		}
	}
	for(int i = 1; i <= n; ++ i) {
		scanf("%d", &sr[i]);
		if(pr[i] < sr[i] || pr[i] - sr[i] > n)
			return 0 * puts("No");
		row.push(Node(pr[i] - sr[i], i));
	}
	for(int i = 1; i <= n; ++ i) {
		scanf("%d", &sc[i]);
		if(pc[i] < sc[i] || pc[i] - sc[i] > n)
			return 0 * puts("No");
		col.push(Node(pc[i] - sc[i], i));
	}
	while(!row.empty()) {
		auto [sub, i] = row.top();
		row.pop();
		v.clear();
		while(sub > 0) {
			auto [w, j] = col.top();
			col.pop();
			if(w == 0)
				return 0 * puts("No");
			-- sub, -- w, flg[i][j] = 1;
			v.push_back(Node(w, j));
		}
		for(auto nd : v)
			col.push(nd);
	}
	puts("Yes");
	for(int i = 1; i <= n; ++ i) {
		for(int j = 1; j <= n; ++ j) {
			if(s[i][j] == '+') {
				putchar(flg[i][j] ? '0' : '1');
			}
			else {
				putchar(flg[i][j] ? '1' : '0');
			}
		}
		puts("");
	}
}