#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define per(i,r,l) for(int i=r; i>=l; i--)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

const int N = 4040;

int row[N], col[N], wb[N], rk[N];
char a[4040][4040];
bool ksj[4040][4040];

char tmp[N];

int main() {
    int n; scanf("%d", &n);
    rep (i, 1, n) {
        scanf("%s", tmp+1);
        rep (j, 1, n) {
            if (tmp[j] == '+') a[i][j] = 1;
        }
    }
    rep (i, 1, n) {
        scanf("%d", &row[i]);
    }
    rep (i, 1, n) {
        scanf("%d", &col[i]);
    }
    rep (i, 1, n) {
        rep (j, 1, n) {
            if (!a[i][j]) {
                row[i]++, col[j]++;
                ksj[i][j] = 1;
            }
        }
    }
    int sumS = 0, sumT = 0;
    rep (i, 1, n) {
        if (row[i] < 0 || row[i] > n) goto gg;
        if (col[i] < 0 || col[i] > n) goto gg;
        sumS += row[i], sumT += col[i];
    }
    if (sumS != sumT) goto gg;

    rep (i, 1, n) {
        // if (col[j] < 0) goto gg;
        rep (j, 1, n) {
            if (col[j] < 0) goto gg;
            wb[col[j]]++;
        }
        rep (j, 1, n) wb[j] += wb[j-1];
        rep (j, 1, n) rk[j] = wb[col[j]]--;
        rep (j, 1, n) {
            if (rk[j] >= n - row[i] + 1) {
                col[j]--;
                ksj[i][j] ^= 1;
            }
        }
    }
    rep (j, 1, n) {
        if (col[j] < 0) goto gg;
    }
    puts("Yes");
    rep (i, 1, n) {
        rep (j, 1, n) {
            printf("%d", ksj[i][j]);
        }
        cout << '\n';
    }
    return 0;

    gg:
    puts("No");
    return 0;
}