#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector a(n, vector<int>(n));
    vector ans(n, vector<int>(n));
    for (int i = 0; i < n; i += 1) {
        string s;
        cin >> s;
        for (int j = 0; j < n; j += 1) {
            if (s[j] == '+') {
                a[i][j] = 1;
            } else {
                a[i][j] = -1;
            }
        }
    }

    vector<int> r(n), c(n);
    for (int i = 0; i < n; i += 1) {
        cin >> r[i];
    }
    for (int i = 0; i < n; i += 1) {
        cin >> c[i];
    }
    for (int i = 0; i < n; i += 1) {
        for (int j = 0; j < n; j += 1) {
            if (a[i][j] == -1) {
                ans[i][j] = 1;
                r[i] += 1;
                c[j] += 1;
            }
        }
    }
    vector<int> row(n), col(n);
    iota(row.begin(), row.end(), 0);
    iota(col.begin(), col.end(), 0);
    sort(row.begin(), row.end(), [&](int x, int y) { return r[x] > r[y]; });
    for (int i : row) {
        sort(col.begin(), col.end(), [&](int x, int y) { return c[x] > c[y]; });
        for (int j : col) {
            if (r[i] <= 0) break;
            if (c[j] > 0) {
                if (ans[i][j]) {
                    r[i] += a[i][j];
                    c[j] += a[i][j];
                } else {
                    r[i] -= a[i][j];
                    c[j] -= a[i][j];
                }
                ans[i][j] ^= 1;
            }
        }
    }
    for (int i = 0; i < n; i += 1) {
        if (r[i] || c[i]) {
            cout << "No\n";
            return 0;
        }
    }
    cout << "Yes\n";
    for (int i = 0; i < n; i += 1) {
        for (int j = 0; j < n; j += 1) {
            cout << ans[i][j];
        }
        cout << '\n';
    }

    return 0;
}