// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
int n, b[4005], c[4005], B[4005], C[4005];
char a[4005][4005];
bool ans[4005][4005];
std::vector<int> rkb, rkc;
bool check()
{
    for (int i = 0; i != n; ++i)
        for (int j = 0; j != n; ++j)
            if (ans[i][j])
            {
                B[i] -= (a[i][j] == '+' ? +1 : -1);
                C[j] -= (a[i][j] == '+' ? +1 : -1);
            }
    for (int i = 0; i != n; ++i)
        if (B[i] || C[i])
            return false;
    return true;
}
void myassert(bool con)
{
    if (!con)
    {
        std::cout << "No" << std::endl;
        exit(0);
    }
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n;
    for (int i = 0; i != n; ++i)
        for (int j = 0; j != n; ++j)
            std::cin >> a[i][j];
    for (int i = 0; i != n; ++i)
        std::cin >> b[i], B[i] = b[i];
    for (int i = 0; i != n; ++i)
        std::cin >> c[i], C[i] = c[i];
    for (int i = 0; i != n; ++i)
        for (int j = 0; j != n; ++j)
            if (a[i][j] == '-')
                ++b[i], ++c[j], ans[i][j] = true;
    rkb.resize(n);
    rkc.resize(n);
    std::iota(rkb.begin(), rkb.end(), 0);
    std::iota(rkc.begin(), rkc.end(), 0);
    std::sort(rkb.begin(), rkb.end(), [&](const int &A, const int &B)
              { return b[A] > b[B]; });
    std::sort(rkc.begin(), rkc.end(), [&](const int &A, const int &B)
              { return c[A] > c[B]; });
    for (auto i : rkb)
    {
        myassert(0 <= b[i] && b[i] <= n);
        std::vector<int> tmp(rkc.begin(), rkc.begin() + b[i]), tmpp(rkc.begin() + b[i], rkc.end());
        for (auto j : tmp)
            ans[i][j] ^= true, --b[i], --c[j];
        std::merge(tmp.begin(), tmp.end(), tmpp.begin(), tmpp.end(), rkc.begin(),
                   [&](const int &A, const int &B)
                   { return c[A] > c[B]; });
    }
    if (check())
    {
        std::cout << "Yes" << std::endl;
        for (int i = 0; i != n; ++i, std::cout << std::endl)
            for (int j = 0; j != n; ++j)
                std::cout << ans[i][j];
    }
    else
        std::cout << "No" << std::endl;
    return 0;
}