#include<iostream>
#include<cstring>
#include<vector>
#include<limits>
using namespace std;
using LL = long long;

const int maxn = 1e5 + 5, maxm = 3.5e7 + 5;
template<typename flow_t>
struct MaxFlow{

    const flow_t INF = numeric_limits<flow_t>::max() / 2;

    int h[maxn], e[maxm], ne[maxm], idx;
    flow_t f[maxm];
    int cur[maxn], q[maxn], d[maxn];
    int V, S, T;

    void init(int v, int s, int t){
        for(int i = 0; i <= v; i++) h[i] = -1;
        idx = 0;
        V = v, S = s, T = t;
    }
    
    void add(int a, int b, flow_t c, flow_t d = 0){
        e[idx] = b, f[idx] = c, ne[idx] = h[a], h[a] = idx++;
        e[idx] = a, f[idx] = d, ne[idx] = h[b], h[b] = idx++;
    }
    
    bool bfs(){
        for(int i = 0; i <= V; i++) d[i] = -1;
        int hh = 0, tt = -1;
        q[++tt] = S, d[S] = 0, cur[S] = h[S];
        while(hh <= tt){
            int t = q[hh++];
            for(int i = h[t]; ~i; i = ne[i]){
                int j = e[i];
                if (d[j] == -1 && f[i]){
                    d[j] = d[t] + 1;
                    cur[j] = h[j];
                    if (j == T) return true;
                    q[++tt] = j;
                }
            }
        }
        return false;
    }
    
    flow_t find(int u, flow_t limit){
        if (u == T) return limit;
        flow_t flow = 0;
        // start from cur[u] instead of h[u] <- important
        for(int i = cur[u]; ~i && flow < limit; i = ne[i]){
            int j = e[i];
            cur[u] = i;
            if (d[j] == d[u] + 1 && f[i]){
                flow_t t = find(j, min(f[i], limit - flow));
                if (!t) d[j] = -1;
                else f[i] -= t, f[i ^ 1] += t, flow += t; 
            }
        }
        return flow;
    }
    
    flow_t dinic(){
        flow_t res = 0, flow;
        while(bfs()) while(flow = find(S, INF)) res += flow;
        return res;
    }
};

MaxFlow<int> flow;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    vector<string> g(n);
    for(int i = 0; i < n; i++) cin >> g[i];
    vector<int> a(n), b(n);
    int sum1 = 0, sum2 = 0;
    for(int i = 0; i < n; i++) 
        cin >> a[i], sum1 += a[i];
    for(int i = 0; i < n; i++) 
        cin >> b[i], sum2 += b[i];
        
    if (sum1 != sum2){
        cout << "No" << '\n';
        return 0;
    }    
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if (g[i][j] == '-'){
                sum1 += 1;
                sum2 += 1;
                a[i] += 1;
                b[j] += 1;
            }
        }
    }
    int s = 2 * n, t = 2 * n + 1;
    flow.init(2 * n + 1, s, t);
    for(int i = 0; i < n; i++){
        if (a[i] < 0){
            cout << "No" << '\n';
            return 0;
        }
        flow.add(s, i, a[i]);
    }
    for(int i = 0; i < n; i++){
        if (b[i] < 0){
            cout << "No" << '\n';
            return 0;
        }
        flow.add(i + n, t, b[i]);
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            flow.add(i, j + n, 1);
        }
    }
    if (flow.dinic() != sum1){
        cout << "No" << '\n';
        return 0;
    }
    vector<vector<int> > ans(n, vector<int>(n));
    for(int x = 0; x < n; x++){
        for(int i = flow.h[x]; ~i; i = flow.ne[i]){
            int j = flow.e[i];
            if (j >= n && j < 2 * n && !flow.f[i]){
                ans[x][j - n] = 1;
            }
        }
    }
    cout << "Yes" << '\n';
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if (g[i][j] == '-'){
                ans[i][j] ^= 1;
            }
            cout << ans[i][j];
        }
        cout << '\n';
    }

}