#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template<class T>
bool chmin(T &a, T b) {
    if(a <= b) return false;
    a = b;
    return true;
}

template<class T>
bool chmax(T &a, T b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    int n; cin >> n;
    vector c(n, vector<char>(n));
    rep(i,0,n){
        rep(j,0,n){
            cin >> c[i][j];
        }
    }

    vector<int> a(n), b(n);
    rep(i,0,n){
        cin >> a[i];
    }
    rep(i,0,n){
        cin >> b[i];
    }

    vector ans(n, vector<int>(n, 0));

    rep(i,0,n){
        rep(j,0,n){
            if (c[i][j] == '-'){
                ans[i][j] = 1;
                a[i] += 1;
                b[j] += 1;
            }
        }
    }
    
    rep(i,0,n){
        if (a[i] < 0){
            cout << "No\n";
            return 0;
        }
    }

    rep(i,0,n){
        if (b[i] < 0){
            cout << "No\n";
            return 0;
        }
    }

    vector<pair<int,int>> d;
    rep(i,0,n){
        d.push_back(pair(a[i], i));
    }
    sort(d.begin(), d.end());
    reverse(d.begin(), d.end());

    rep(i,0,n){
        vector<vector<int>> bucket(2 * n + 4, vector<int>(0)); 
        rep(t,0,n){
            bucket[b[t]].push_back(t);
        }
        int x = d[i].second;
        int piv = d[i].first;
        rrep(j, 1, 2 * n + 4){
            while(piv > 0 && !bucket[j].empty()){
                int y = bucket[j].back();
                ans[x][y] ^= 1;
                b[y]--;
                bucket[j].pop_back();
                piv--;
            }
            if (piv == 0) break;
        }
        if (piv > 0){
            cout << "No\n";
            return 0;
        }
    }

    rep(i,0,n){
        if (b[i] != 0){
            cout << "No\n";
            return 0;
        }
    }

    cout << "Yes\n";

    rep(i,0,n){
        rep(j,0,n){
            cout << ans[i][j];
        }
        cout << '\n';
    }
    
    
}