#pragma GCC optimize(3)
#include<bits/stdc++.h>
const int N = 10005;
const int INF = 0x3f3f3f3f;
using namespace std;
int s, t, tot = 1, cnt;
struct Edge{
        int next, to, cap, flow; 
}edge[N * 10000];
int head[N];
void add(int u, int v, int w, int rw = 0){
        edge[++tot] = {head[u], v, w, 0};
    head[u] = tot;
    edge[++tot] = {head[v], u, 0, 0};
        head[v] = tot;
}
int maxflow = 0;
int dep[N], cur[N];
bool bfs(){
        queue<int> q;
        memset(dep, 0, sizeof (dep[0]) * (cnt + 1));
        dep[s] = 1;
        q.push(s);
        while(q.size()){
                int u = q.front();
                q.pop();
                for(int i = head[u]; i; i = edge[i].next){
                        int v = edge[i].to;
                        if((!dep[v]) && (edge[i].cap > edge[i].flow)){
                                dep[v] = dep[u] + 1;
                                if(v == t) return 1;
                                q.push(v);
                        }
                }
        }
        return 0;
}
int dfs(int u, int flow){
        if((u == t) || (!flow)) return flow;
        int ret = 0;
        for(int &i = cur[u]; i; i = edge[i].next){
                int v = edge[i].to, d;
                if(dep[v] != dep[u] + 1) continue;
                d = dfs(v, min(flow - ret, edge[i].cap - edge[i].flow));
                if(d){
                        ret += d;
                        edge[i].flow += d;
                        edge[i ^ 1].flow -= d;
                        if(ret == flow) return ret;
                }
        }

        return ret;
}
void dinic(){
        while(bfs()){
                memcpy(cur, head, sizeof (head[0]) * (cnt + 1));
                maxflow += dfs(s, INF);
        }
}
void solve(){
        memset(head, 0, sizeof head);
        // memset(dat, 0, sizeof dat);
        // memset(vis, 0, sizeof vis);
        tot = 1; // this is important
		int n;
        cin >> n;
        s = 2 * n + 1; t = 2 * n + 2;
        int x = 0, y = 0;
        for(int i = 1; i <= n; ++ i)
        	for(int j = 1; j <= n; ++ j){
        		char ch;
        		cin >> ch;
        		if(ch == '+'){
        			add(i, j + n, 1);
        		}else{
        			add(j + n, i, 1);
        		}
        	}
        int ans = 0;
        vector<int> a(n + 1), b(n + 1);
        for(int i = 1; i <= n; ++ i) cin >> a[i], x += a[i];
        for(int i = 1; i <= n; ++ i) cin >> b[i], y += b[i];
        for(int i = 1; i <= n; ++ i){
        	if(a[i] > 0) ans += a[i];
        	if(a[i] > 0){
        		add(s, i, a[i]);
        	}else add(i, t, -a[i]);
        }
        for(int i = 1; i <= n; ++ i){
        	if(b[i] < 0) ans -= b[i];
        	if(b[i] < 0) add(s, i + n, -b[i]);
        	else add(i + n, t, b[i]);
        }
        cnt = 2 * n + 2;
        tot = 1;
        maxflow = 0;
        // cout << ans << endl;
        dinic();
        if(ans != maxflow || x != y){
        	cout << "No" << endl;
        }else{
        	cout << "Yes" << endl;
        	vector<vector<int>> vis(n + 10, vector<int>(n + 10)); 
        	for(int i = 1; i <= n; ++ i){
        		for(int j = head[i]; j; j = edge[j].next){
        			int v = edge[j].to;
        			if(v == s || v == t) continue;
        			v -= n;
        			// cout << i << " " << v << " " << j << endl;
        			if(edge[j].flow != 0){
        				vis[i][v] = 1;
        			}
        		}
        	}
        	for(int i = 1; i <= n; ++ i){
        		for(int j = 1; j <= n; ++ j) cout << vis[i][j];
        		// cout << "\n"; 
        		cout << endl;
        	}
        }
}
int main(){
        ios::sync_with_stdio(false);
        int T = 1;
        // cin >> T; 
        while(T--){
                solve();
        }
}