#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<string> S(n);
    cin >> S;
    vector<int> r(n), c(n);
    cin >> r >> c;

    if (accumulate(all(r), 0) != accumulate(all(c), 0)) {
        cout << "No\n";
        return 0;
    }

    auto sr = r, sc = c;
    vector ans(n, vector<int>(n, 0));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (S[i][j] == '-') {
                r[i]++;
                c[j]++;
                ans[i][j] = 1;
            }
        }
    }
    vector<int> cur = c;
    for (int i = 0; i < n; i++) {
        vector<pair<int, int>> tmp;
        for (int j = 0; j < n; j++) {
            tmp.emplace_back(cur[j], j);
        }
        ranges::sort(tmp, greater{});
        for (int j = 0; j < r[i]; j++) {
            auto [val, idx] = tmp[j];
            if (val <= 0) {
                cout << "No\n";
                return 0;
            }
            ans[i][idx] ^= 1;
            cur[idx]--;
        }
    }
    vector<int> nr(n), nc(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (ans[i][j]) {
                int x = S[i][j] == '-' ? -1 : 1;
                nr[i] += x;
                nc[j] += x;
            }
        }
    }
    if (sr != nr or sc != nc) {
        cout << "No\n";
        return 0;
    }

    cout << "Yes\n";
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << ans[i][j];
        }
        cout << '\n';
    }
    return 0;
}