#include <bits/stdc++.h>

using namespace std;

const int N = 105;

int a[N][N], b[N], c[N];

signed main() {
    int n; scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        string s; cin >> s, s = ' ' + s;
        for (int j = 1; j <= n; ++j) {
            if (s[j] == '-') a[i][j] = 1, --b[i], --c[j];
            else a[i][j] = 0;
        }
    }
    for (int i = 1; i <= n; ++i) {
        int x; scanf("%d", &x);
        if (x < b[i]) return 0 & puts("No");
        b[i] = x - b[i];
    }
    for (int i = 1; i <= n; ++i) {
        int x; scanf("%d", &x);
        if (x < c[i]) return 0 & puts("No");
        c[i] = x - c[i];
    }
    for (int i = 1; i <= n; ++i) {
        vector< pair<int, int> > pos;
        for (int j = 1; j <= n; ++j) pos.push_back({c[j], j});
        sort(pos.rbegin(), pos.rend());
        if (b[i] > n) return 0 & puts("No");
        for (int j = 0; j < b[i]; ++j) {
            if (!c[pos[j].second]--) return 0 & puts("No");
            a[i][pos[j].second] ^= 1;
        }
    }
    for (int i = 1; i <= n; ++i) {
        if (c[i]) return 0 & puts("No");
    }
    puts("Yes");
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) putchar(a[i][j] + '0');
        puts("");
    }
    return 0;
}