#include <bits/stdc++.h>

const int N = 4010;

int n;
char str[N][N];

int a[N], b[N];

struct node {
    int id, val;

    node() {}
    node(int _id, int _val) : id(_id), val(_val) {}

    bool operator < (const node &rhs) const {
        return val > rhs.val;
    }
} tmp[N];

bool choose[N][N];

int main() {
    scanf("%d", &n);

    for (int i = 1; i <= n; i ++)
        scanf("%s", str[i] + 1);
    
    for (int i = 1; i <= n; i ++) scanf("%d", &a[i]);
    for (int i = 1; i <= n; i ++) scanf("%d", &b[i]);

    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= n; j ++)
            if (str[i][j] == '-') a[i] ++, b[j] ++;

    for (int i = 1; i <= n; i ++)
        if (a[i] < 0 || a[i] > n) {
            puts("No");
            return 0;
        }

    for (int i = 1; i <= n; i ++)
        if (b[i] < 0 || b[i] > n) {
            puts("No");
            return 0;
        }

    for (int i = 1; i <= n; i ++) {
        int x = a[i];
        
        if (!x) continue;

        int t = 0;
        for (int j = 1; j <= n; j ++) tmp[++ t] = node(j, b[j]);

        std::sort(tmp + 1, tmp + 1 + n);

        if (!tmp[x].val) {
            puts("No");
            return 0;
        }

        for (int j = 1; j <= x; j ++) {
            b[tmp[j].id] --;
            choose[i][tmp[j].id] = 1;
        }
    }

    for (int j = 1; j <= n; j ++)
        if (b[j]) {
            puts("No");
            return 0;
        }

    puts("Yes");
    for (int i = 1; i <= n; i ++, puts(""))
        for (int j = 1; j <= n; j ++)
            printf("%d", choose[i][j] ^ (str[i][j] == '-'));

    return 0;
}