#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define N 4010

int n;
string s;

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


pair<int, int>p[N];

int main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i ++)
    {
        cin >> s;
        for (int j = 1; j <= n; j ++)
        {
            if (s[j - 1] == '-') a[i] ++, b[j] ++, c[i][j] = 1;
            else c[i][j] = 0;
        }
    }

    for (int i = 1; i <= n; i ++)
    {
        int x;
        cin >> x; a[i] += x;
    }
    for (int i = 1; i <= n; i ++)
    {
        int x;
        cin >> x; b[i] += x;
    }

    // for (int i = 1; i <= n; i ++) cout << a[i] << ' '; cout << endl;
    // for (int i = 1; i <= n; i ++) cout << b[i] << ' '; cout << endl;

    for (int i = 1; i <= n; i ++)
    {
        if (a[i] < 0 || a[i] > n) {cout << "No\n"; return 0;}
        for (int j = 1; j <= n; j ++)
        {
            p[j] = {b[j], j};
        }
        sort(p + 1, p + n + 1);
        // cout << "GG:" << i << ' ' << a[i] << endl;
        for (int j = n; j >= n - a[i] + 1; j --)
        {
            int w = p[j].first, x = p[j].second;
            // cout << "??:" << x << endl;
            if (w <= 0) {cout << "No\n"; return 0;}
            b[x] --; c[i][x] ^= 1;
        }
        a[i] = 0;
    }
    for (int i = 1; i <= n; i ++)
    {
        assert(a[i] == 0);
        if (b[i] != 0) {cout << "No\n"; return 0;}
    }
    cout << "Yes\n";
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j <= n; j ++)
        {
            cout << c[i][j];
        }
        cout << '\n';
    }
    return 0;
}