#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
using namespace std;

typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef long long ll;

template <typename _T>
inline void read(_T &f) {
    f = 0; _T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}

template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}

template <typename T>
void print(T x, char t) {
    print(x); putchar(t);
}

const int N = 4005;

char s[N][N];
int r[N], c[N], ans[N][N];
int x[N], y[N], xx[N], yy[N], id[N];
int n;

bool cmp(int i, int j) {
    return c[i] < c[j];
}

int main() {
    read(n);
    for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
    for (int i = 1; i <= n; i++) read(r[i]);
    for (int i = 1; i <= n; i++) read(c[i]);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (s[i][j] == '-') {
                ++r[i];
                ++c[j];
            }
        }
    }
    for (int i = 1; i <= n; i++) id[i] = i;
    sort(id + 1, id + n + 1, cmp);
    for (int i = 1; i <= n; i++) x[i] = id[i], y[i] = c[id[i]];
    for (int i = 1; i <= n; i++) {
        int can = n - r[i];
        for (int j = 1; j <= can; j++) {
            ans[i][x[j]] = 1;
            ++y[j];
            if (y[j] > n) {
                printf("No\n");
                return 0;
            }
        }
        int p1 = 1, p2 = can + 1, p3 = 1;
        while (p1 <= can || p2 <= n) {
            if (p2 > n) {
                xx[p3] = x[p1]; yy[p3] = y[p1]; ++p1; ++p3;
            } else if (p1 > can) {
                xx[p3] = x[p2]; yy[p3] = y[p2]; ++p2; ++p3;
            } else if (y[p1] <= y[p2]) {
                xx[p3] = x[p1]; yy[p3] = y[p1]; ++p1; ++p3;
            } else {
                xx[p3] = x[p2]; yy[p3] = y[p2]; ++p2; ++p3;
            }
        }
        for (int j = 1; j <= n; j++) {
            x[j] = xx[j];
            y[j] = yy[j];
        }
    }
    if (y[1] != n || y[n] != n) {
        printf("No\n");
        return 0;
    }
    printf("Yes\n");
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (s[i][j] == '-') ans[i][j] ^= 1;
            if (ans[i][j]) putchar('0');
            else putchar('1');
        }
        putchar('\n');
    }
    return 0;
}