#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 4010;

int n, s, t, a[maxn], b[maxn], p[maxn], ans[maxn][maxn];
char str[maxn][maxn];

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n;
  rep (i, 1, n) cin >> (str[i] + 1);
  rep (i, 1, n) cin >> a[i];
  rep (i, 1, n) cin >> b[i];
  rep (i, 1, n) {
    int s = 0;
    rep (j, 1, n) {
      if (str[i][j] == '-') s--;
    }
    a[i] -= s;
  }
  rep (i, 1, n) {
    int s = 0;
    rep (j, 1, n) {
      if (str[j][i] == '-') s--;
    }
    b[i] -= s;
  }
  rep (i, 1, n) if (a[i] > n) return cout << "No\n", 0;
  rep (i, 1, n) if (b[i] > n) return cout << "No\n", 0;
  int sa = 0, sb = 0;
  rep (i, 1, n) sa += a[i], sb += b[i];
  if (sa != sb) return cout << "No\n", 0;
  rep (i, 1, n) p[i] = i;
  rep (i, 1, n) {
    int rest = a[i];
    sort(p + 1, p + n + 1, [&](int x, int y) { return b[x] > b[y]; });
    rep (j, 1, n) if (rest && b[p[j]]) {
      ans[i][p[j]] ^= 1, rest--, b[p[j]]--;
    }
    if (rest) return cout << "No\n", 0;
  }
  rep (i, 1, n) if (b[i]) return cout << "No\n", 0;
  cout << "Yes\n";
  rep (i, 1, n) {
    rep (j, 1, n) ans[i][j] ^= (str[i][j] == '-'), cout << ans[i][j];
    cout << "\n";
  }
}