#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back

#define Yes cout << "Yes\n"
#define No cout << "No\n"
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ff first
#define ss second
#define fori(x,y) for(int i=x;i<=(int)(y);++i)
#define forj(x,y) for(int j=x;j<=(int)(y);++j)
#define fork(x,y) for(int k=x;k<=(int)(y);++k)

#define debug(x) cerr << #x << " = " << x << endl

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

ll MOD = 998244353;
ll qpow(ll a,ll p) {ll res=1; while(p) {if (p&1) {res=res*a%MOD;} a=a*a%MOD; p>>=1;} return res;}

const int N = 4005;

int arr[N][N], ans[N][N];
int sum[N][2];
signed main() {
	IOS;
    int n; scanf("%d", &n);
    fori(1, n) {
        char str[4005];
        scanf("%s", str+1);
        forj(1, n) arr[i][j] = str[j] == '+'?1:-1;
    }
    fori(1, n) scanf("%d", &sum[i][0]);
    fori(1, n) scanf("%d", &sum[i][1]);

    fori(1, n) forj(1, n) {
        if (arr[i][j] == -1) {
            ans[i][j] = 1;
            sum[i][0]++, sum[j][1]++;
        }
    }
    // fori(1, n) cout << sum[i][0] << " ";
    // cout << endl;
    // fori(1, n) cout << sum[i][1] << " ";
    // cout << endl;

    priority_queue<pii> pri;
    forj(1, n) if (sum[j][1]) pri.push({sum[j][1], j});
    bool can = true;
    fori(1, n) {
        priority_queue<pii> tmp;
        while (sum[i][0]) {
            if (pri.size()) {
                auto [d, j] = pri.top();
                pri.pop();
                ans[i][j] = !ans[i][j];
                // debug(d);
                // debug(j);
                if (d>1) tmp.push({d-1, j});
                sum[i][0]--;
            }
            else {
                can = false;
                break;
            }
        }
        if (can) {
            while (pri.size()) tmp.push(pri.top()), pri.pop();
            swap(tmp, pri);
        }
        else break;
    }
    if (pri.size()) can = false;
    if (can) {
        Yes;
        fori(1, n) {
            forj(1, n) cout << ans[i][j];
            cout << endl;
        }
    }
    else No;
	return 0;
}