#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n;
    cin >> n;
    vector<string> s(n);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
    } 
    vector<int> val1(n);
    vector<int> val2(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (s[i][j] == '-') {
                val1[i]--, val2[j]--;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        val1[i] = x - val1[i];
    }
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        val2[i] = x - val2[i];
    }
    vector<vector<int>> ans(n, vector<int>(n));
    for (int i = 0; i < n; i++) {
        vector<int> id(n);
        for (int j = 0; j < n; j++) {
            id[j] = j;
        }
        sort(id.begin(), id.end(), [&](int a, int b) {return val2[a] > val2[b];});
        for (auto j : id) {
            if (val1[i] && val2[j]) {
                val1[i]--, val2[j]--;
                ans[i][j] = s[i][j] == '+';
            } else {
                ans[i][j] = s[i][j] == '-';
            }
        }
    }
    for (int i = 0; i < n; i++) {
        if (val1[i] || val2[i]) {
            cout << "No\n";
            return ;
        }
    }
    cout << "Yes\n";
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << ans[i][j];
        }
        cout << '\n';
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    while(t--) solve();
}