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

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;
            }
        }
    }

    for(int i = 0; i < n; i++){
        if (a[i] < 0 || a[i] > n || b[i] < 0 || b[i] > n){
            cout << "No" << '\n';
            return 0;
        }
    }
    vector<int> id1(n), id2(n);
    for(int i = 0; i < n; i++){
        id1[i] = id2[i] = i;
    }
    vector<vector<int> > ans(n, vector<int>(n));
    sort(id1.begin(), id1.end(), [&](int x, int y){
        return a[x] > a[y];
    });
    for(auto x : id1){
        sort(id2.begin(), id2.end(), [&](int x, int y){
            return b[x] > b[y];
        });
        for(int i = 0; i < a[x]; i++){
            ans[x][id2[i]] = 1;
            b[id2[i]] -= 1;
        }
    }
    for(int i = 0; i < n; i++){
        if (b[i] < 0){
            cout << "No" << '\n';
            return 0;
        }
    }
    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';
    }

}