#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector<string> s(n);
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
    }
    vector<int> a(n),b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
    }
    auto res = s;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            res[i][j] = '0';
            if (s[i][j] == '+') {
                res[i][j] = '1';
                a[i] -= 1;
                b[j] -= 1;
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        if (a[i] > 0 or a[i] < -n) {
            cout << "No" << endl;
            return 0;
        }
        if (b[i] > 0 or b[i] < -n) {
            cout << "No" << endl;
            return 0;
        }
        a[i] = abs(a[i]);
        b[i] = abs(b[i]);
    }
    priority_queue<pair<int,int>> pq;
    for (int i = 0; i < n; ++i) {
        if (b[i]) pq.push({b[i], i});
    }
    for (int i = 0; i < n; ++i) {
        vector<pair<int,int>> used;
        for (int j = 0; j < a[i]; ++j) {
            if (pq.size() == 0) {
                cout << "No" << endl;
                return 0;
            }
            auto p = pq.top(); pq.pop();
            res[i][p.second] ^= 1;
            p.first -= 1;
            if (p.first > 0) {
                used.push_back(p);
            }
        }
        for (auto p : used) pq.push(p);
    }
    if (pq.size()) {
        cout << "No" << endl;
    }
    else {
        cout << "Yes\n";
        for (int i = 0; i < n; ++i) {
            cout << res[i] << "\n";
        }
    }
}