#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve()
{
    int n;
    cin >> n;
    vector<string> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    vector<vector<int>> ans(n, vector<int>(n));
    vector<int> vr(n), vc(n);
    for (int i = 0; i < n; ++i) cin >> vr[i];
    for (int i = 0; i < n; ++i) cin >> vc[i];
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            if (a[i][j] == '-') vr[i]++, vc[j]++;
        }
    }
    for (int i = 0; i < n; ++i)
    {
        if (vr[i] > n || vc[i] > n || vr[i] < 0 || vc[i] < 0)
        {
            cout << "No\n";
            return;
        }
    }
    for (int i = 0; i < n; ++i)
    {
        vector<vector<int>> v(n + 1);
        for (int j = 0; j < n; ++j) v[vc[j]].push_back(j);
        for (int j = n; j >= 1; --j)
        {
            for (auto e : v[j])
            {
                if (vr[i] == 0 || vc[e] == 0) continue;
                ans[i][e] = 1;
                vr[i]--;
                vc[e]--;
            }
        }
    }
    if (count(vr.begin(), vr.end(), 0) + count(vc.begin(), vc.end(), 0) != n * 2)
    {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            if (a[i][j] == '-') ans[i][j] ^= 1;
            cout << ans[i][j];
        }
        cout << '\n';
    }
    return;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    //cin >> T;
    while (T--) solve();
    return 0;
}