#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
constexpr int inf = 0x3f3f3f3f;

#define Buff ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
//#define int long long
const int N = 5000;
int r[N],c[N],pos[N];
int ans[N][N];
void solve()
{
    int n;
    cin >> n;
    vector<string> s(n + 1);
    for (int i = 1;i <= n;i ++)
    {
        pos[i] = i;
        cin >> s[i];
        s[i] = " " + s[i];
        int x = 0;
        for (int j = 1;j <= n;j ++)
        {
            r[i] += s[i][j] == '+';
            c[j] += s[i][j] == '+';
        }
    }
    for (int i = 1,x;i <= n;i ++)
    {
        cin >> x;
        r[i] -= x;
        if (r[i] < 0)
        {
            cout <<"No\n";
            return;
        }
    }
    for (int i = 1,x;i <= n;i ++)
    {
        cin >> x;
        c[i] -= x;
        if (c[i] < 0)
        {
            cout <<"No\n";
            return;
        }
    }
    for (int i = 1;i <= n;i ++)
    {
        sort(pos + 1,pos + 1 + n,
             [&](int a,int b)
             {
                return c[a] > c[b];
             });
        for (int j = 1;j <= r[i];j ++)
        {
            if (c[pos[j]] == 0)
            {
                cout <<"No\n";
                return;
            }
            c[pos[j]] --;
            ans[i][pos[j]] = 1;
        }
    }
    for (int i = 1;i <= n;i ++)
    {
        if (c[i] != 0)
        {
            cout <<"No\n";
            return;
        }
    }

    cout << "Yes\n";
    for (int i = 1;i <= n;i ++)
    {
        for (int j = 1;j <= n;j ++)
        {
            cout << char('0' + (ans[i][j] ^ (s[i][j] == '+')));
        }
        cout << "\n";
    }

}

signed main()
{
#ifdef YGYYYGJ
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    Buff;
    int _T_ = 1;
    //cin >> _T_;
    while (_T_--)
        solve();
    return 0;
}