#include<bits/stdc++.h>
using namespace std;
#define int long long
#define i64 long long

void solve() {
    int n; cin >> n;
    
    vector<vector<short> > a(n, vector<short>(n));
    vector<vector<short> > b(n, vector<short>(n));

    for(int i = 0; i < n; ++ i) {
        string s; cin >> s;
        for(int j = 0; j < n; ++ j)
            a[i][j] = (s[j] != '+');
    }

    vector<pair<int, int> > r(n), c(n);
    for(int i = 0; i < n; ++ i) 
        cin >> r[i].first, r[i].second = i;
        
    for(int i = 0; i < n; ++ i)
        cin >> c[i].first, c[i].second = i;
        
    for(int i = 0; i < n; ++ i) 
        for(int j = 0; j < n; ++ j)
            if (a[i][j] == 1) r[i].first ++, c[j].first ++;

    for(int i = 0; i < n; ++ i) {
        int num = r[i].first;
        if (num < 0 || num > n) { cout << "No\n"; return ; }
        sort(c.begin(), c.end(), greater<pair<int, int> >());
        for(int j = 0; j < num; ++ j) { 
            b[i][c[j].second] = 1;
            c[j].first -= 1;
        }
    }
    for(int i = 0; i < n; ++ i)
        if (c[i].first != 0) {
            cout << "No\n";
            return ;
        } 
    cout << "Yes\n";
    for(int i = 0; i < n; ++ i) {
        for(int j = 0; j < n; ++ j)
            cout << (b[i][j] ^ a[i][j]);
        cout << "\n";
    }
    return;
}
signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0), cin.tie(0);
    int T = 1;
    // cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}