#include <bits/stdc++.h>
#define int long long

using namespace std ;

const int N = 1e6 + 5 ;
int n , m , a[N] ;
int no() {
    cout << "No" << '\n' ; 
    return 0 ; 
}
signed main()
{
    ios::sync_with_stdio(false) ; 
    cin.tie(0) , cout.tie(0) ; 

    cin >> n ; 
    vector a(n , string()) ; 
    for (auto &i : a) cin >> i ; 

    vector r(n , 0) , c = r ; 
    for (auto &i : r) cin >> i ; 
    for (auto &i : c) cin >> i ; 

    if (accumulate(r.begin() , r.end() , 0) != accumulate(c.begin() , c.end() , 0)) 
        return no() ; 
    
    vector ans(n , string(n , '0')) ; 
    for (int i = 0 ; i < n ; ++ i) {
        for (int j = 0 ; j < n ; ++ j) {
            if (a[i][j] == '+') {
                if (r[i] > 0 && c[j] > 0) {
                    ans[i][j] = '1' ; 
                    -- r[i] , -- c[j] ; 
                }
            } 
            else {
                if (r[i] < 0 && c[j] < 0) {
                    ans[i][j] = '1' ; 
                    ++ r[i] , ++ c[j] ; 
                }
            }
        }
        vector pos(0 , 0) ;
        vector neg(0 , 0) ; 
        for (int j = 0 ; j < n ; ++ j) {
            if (ans[i][j] == '1') continue;
            if (c[j] < 0 && a[i][j] == '-') {
                neg.push_back(j) ;
            } 
            if (c[j] > 0 && a[i][j] == '+') {
                pos.push_back(j) ; 
            } 
        }
        for (int k = 0 ; k < min(neg.size() , pos.size()) ; ++ k) {
            ans[i][neg[k]] = ans[i][pos[k]] = '1' , ++ c[neg[k]] , -- c[pos[k]] ; 
        }
    }
    for (int i = 0 ; i < n ; ++ i) 
        if (r[i] || c[i]) return no() ; 
    cout << "Yes" << '\n' ; 
    for (int i = 0 ; i < n ; ++ i) cout << ans[i] << '\n' ; 
    return 0 ; 
}