#include <algorithm>
#include <array>
#include <iostream>
#include <limits>
#include <vector>

using namespace std;

constexpr int N = 4e3;

template<typename T = int>
struct /*Maksim1744*/ Dinic {
	struct Edge {
		int v, u;
		T f, c;
	};
	vector<Edge> ed;
	vector<array<int, 2 * N>> e;
  vector<int> se;
	int n, st, fin;
	T flow;

	vector<int> ptr, ds, que;

	Dinic(int n_, int st_, int fin_) : n(n_), st(st_), fin(fin_), flow(0) {
		e.resize(n);
    fill(&e[0][0], &e[n][0], -1);
		se.resize(n);
		ptr.resize(n);
		ds.resize(n);
		que.resize(n);
	}

	void ae(int v, int u, T c, T bc = 0, T f = 0) {
		int w = int(ed.size());
		ed.push_back({v, u, f, c});
		ed.push_back({u, v, -f, bc});
		e[v][se[v]++] = w;
		e[u][se[u]++] = w + 1;
	}

	bool bfs(T scale) {
		fill(ds.begin(), ds.end(), -1);
		ds[st] = 0;
		int sz = 1;
		que[0] = st;
		for (int it = 0; it < sz; it++) {
			int v = que[it];
			for (int i : e[v]) if (~i)
				if (ed[i].f + scale <= ed[i].c && ds[ed[i].u] == -1) {
					ds[ed[i].u] = ds[v] + 1;
					if (ed[i].u == fin)
						return 1;
					que[sz++] = ed[i].u;
				}
		}
		return 0;
	}

	T dfs(int v, T w, T cs) {
		if (v == fin)
			return w;
		int &i = ptr[v];
		while (i >= 0) {
			auto &t = ed[e[v][i]];
			if (ds[t.u] == ds[v] + 1 && t.f + cs <= t.c) {
				T o = dfs(t.u, min(w, t.c - t.f), cs);
				if (o) {
					t.f += o;
					ed[e[v][i] ^ 1].f -= o;
					return o;
				}
			}
			i--;
		}
		return 0;
	}

	T get(int scale = 30) {
		for (T i = ((T(1)) << scale); i > 0; i >>= 1)
			while (bfs(i)) {
				for (int j = 0; j < n; j++)
					ptr[j] = int(e[j].size()) - 1;
				while (T w = dfs(st, numeric_limits<T>::max(), i))
					flow += w;
			}
		return flow;
	}
};

bool a[N][N];
int rt[N], ct[N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  Dinic<> mf(2 * n + 2, 2 * n, 2 * n + 1);
  for (int i = 0; i < n; ++i) if (string s; cin >> s)
  for (int j = 0; j < n; ++j) a[i][j] = s[j] == '+';
  for (int i = 0; i < n; ++i) cin >> rt[i];
  for (int i = 0; i < n; ++i) cin >> ct[i];
  vector<string> ans(n, string(n, '0'));
  for (int i = 0; i < n; ++i)
  for (int j = 0; j < n; ++j) {
    if (rt[i] > 0 && ct[j] > 0 && a[i][j]) --rt[i], --ct[j], ans[i][j] = '1';
    else if (rt[i] < 0 && ct[j] < 0 && !a[i][j]) ++rt[i], ++ct[j], ans[i][j] = '1';
    else if (a[i][j]) mf.ae(i, n + j, 1);
    else              mf.ae(n + j, i, 1);
  }
  int s[2]{};
  for (int i = 0; i < n; ++i) if (rt[i] > 0) mf.ae(2 * n, i, rt[i]), s[0] += rt[i]; else mf.ae(i, 2 * n + 1, -rt[i]), s[1] -= rt[i];
  for (int i = 0; i < n; ++i) if (ct[i] < 0) mf.ae(2 * n, n + i, -ct[i]), s[0] -= ct[i]; else mf.ae(n + i, 2 * n + 1, ct[i]), s[1] += ct[i];
  if (s[0] != s[1] || s[0] != mf.get(1)) return cout << "NO\n", 0;
  cout << "Yes\n";
  for (int i = 0; i < mf.ed.size(); i += 2) if (auto& e = mf.ed[i]; max(e.u, e.v) < 2 * n && e.f) {
    ans[min(e.u, e.v) % n][max(e.u, e.v) % n] = '1';
  }
  for (auto& s: ans) cout << s << '\n';
}