#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int mod = 1e9 + 7, INF = 0x3f3f3f3f;
const int N = 4010, M = N << 1;
typedef pair<int, int> PII;
int n, m;
int a[N][N], b[N][N];
int needrow[N], needcol[N];
int nowrow[N], nowcol[N];
map<int, vector<int>> mp;

void solve() {
    cin >> n;
    string s;
    for(int i = 1; i <= n; ++ i){
        cin >> s;
        for(int j = 1; j <= n; ++ j){
            if(s[j - 1] == '+')a[i][j] = 0;
            else a[i][j] = -1;
            nowrow[i] += a[i][j];
            b[i][j] = a[i][j];
        }
    }
    for(int j = 1; j <= n; ++ j)
        for(int i = 1; i <= n; ++ i)
            nowcol[j] += a[i][j];
    for(int i = 1; i <= n; ++ i) cin >> needrow[i];
    for(int i = 1; i <= n; ++ i) cin >> needcol[i];

    int rowsum = 0, colsum = 0;
    for(int i = 1; i <= n; ++ i){
        rowsum += needrow[i];
        colsum += needcol[i];
    }
    if(rowsum != colsum){
        cout << "No" << endl;
        return;
    }

    for(int i = 1; i <= n; ++ i){
        int x = needcol[i] - nowcol[i];
//        cout << x << " \n"[i == n];
        if(x > 0) mp[x].emplace_back(i);//修改次数为x的有i列
    }

//    for(int i = 1; i <= n; ++ i){
//        for(int j = 1; j <= n; ++ j){
//            cout << b[i][j] << " \n"[j == n];
//        }
//    }
//    cout << endl;

    bool ok = true;
    for(int i = 1; i <= n; ++ i){
        int x = needrow[i] - nowrow[i];//当前行有i个需要+1
        vector<PII> del;
        for(auto y = mp.rbegin(); x > 0 && y != mp.rend(); ++ y){
            auto z = *y;//first是修改次数， second是列的编号
            while (!z.second.empty() && x > 0){
                x --;
                del.push_back({z.first, z.second.back()});
                z.second.pop_back();
            }
        }
        if(x > 0){
//            cout << i << ' ' << mp.size() << endl;
            ok = false;
            break;
        }
//        cout << "i = " << i << endl;
        while (!del.empty()){//放入del的时候是从大到小，因此此处是从小到大
            auto y = del.back();
            del.pop_back();
//            cout << y.second << ' ';
            b[i][y.second] ++;
            mp[y.first].pop_back();
            if(mp.find(y.first) != mp.end() && mp[y.first].empty()) mp.erase(y.first);
            if(y.first > 1) mp[y.first - 1].emplace_back(y.second);
        }
//        cout << endl;
    }
    if(ok){
        cout << "Yes" << endl;
        for(int i = 1; i <= n; ++ i){
            for(int j = 1; j <= n; ++ j){
                int ans;
                if(b[i][j] == 1) ans = 1;
                else if(b[i][j] == -1) ans = 1;
                else ans = 0;
                cout << ans;
            }
            cout << endl;
        }
    }
    else cout << "No" << endl;

//    cout << endl;
//    for(int i = 1; i <= n; ++ i){
//        for(int j = 1; j <= n; ++ j){
//            cout << b[i][j] << " \n"[j == n];
//        }
//    }
//    cout << endl;
}

signed main() {
#ifdef ONLINE_JUDGE
#else
    freopen("902.in", "r", stdin);
    freopen("902.out", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1; //cin >> t;
    for (int i = 1; i <= t; i++) {
        solve();
    }
    return 0;
}