#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define endl '\n'
const int N=4e3+3;
int g[N][N];
int n;
int h[N],l[N];
int ans[N][N];
void solve() {
    cin >> n;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            char p;
            cin >> p;
            g[i][j] = (p == '+') ? 1 : -1;
        }
    }
    for (int i = 0; i < n; ++i) {
        cin >> h[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> l[i];
    }
    for (int i = 0; i <n ; ++i) {
        for (int j = 0; j <n ; ++j) {
            if(g[i][j]==-1){
              //  g[i][j]=1;
                h[i]++;
                l[j]++;
            }
        }
    }

    for (int i = 0; i <n ; ++i) {
        priority_queue<PII>q;
        for (int j = 0; j <n ; ++j) {
            q.push({l[j],j});
        }
        int k=h[i];
        while(k--){
            auto[x,y] =q.top();
            q.pop();
            if(x>0){
                ans[i][y]=1;
                l[y]--;
            }
            else{
                cout<<"No\n";
                return ;
            }
        }
    }
    cout<<"Yes\n";
    for (int i = 0; i <n ; ++i) {
        for (int j = 0; j <n ; ++j) {
            if(g[i][j]==-1){
                ans[i][j]^=1;
            }
            cout<<ans[i][j];
        }
        cout<<endl;
    }












}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
   // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}