#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N;
char S[4010][4010];
vector<int> A, B;

bool used[4010][4010];
char ans[4010][4010];

bool solve() {
  memset(used, 0, sizeof(used));
  auto as = A, bs = B;
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) if (S[x][y] == '-') {
    as[x] -= (-1);
    bs[y] -= (-1);
  }
  for (int x = 0; x < N; ++x) if (!(0 <= as[x] && as[x] <= N)) return false;
  for (int y = 0; y < N; ++y) if (!(0 <= bs[y] && bs[y] <= N)) return false;
  vector<vector<int>> yss(N + 1);
  for (int y = 0; y < N; ++y) yss[bs[y]].push_back(y);
  vector<int> ys(N);
  for (int x = 0; x < N; ++x) {
    int ysLen = 0;
    for (int b = N; b > 0; --b) {
      for (; ysLen < as[x] && yss[b].size(); ) {
        ys[ysLen++] = yss[b].back();
        yss[b].pop_back();
      }
    }
    if (ysLen < as[x]) {
      return false;
    }
    for (int i = 0; i < ysLen; ++i) {
      const int y = ys[i];
      used[x][y] = true;
      yss[--bs[y]].push_back(y);
    }
  }
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) {
    if (S[x][y] == '-') {
      ans[x][y] = used[x][y] ? '0' : '1';
    } else {
      ans[x][y] = used[x][y] ? '1' : '0';
    }
  }
  puts("Yes");
  for (int x = 0; x < N; ++x) {
    puts(ans[x]);
  }
  return true;
}

int main() {
  for (; ~scanf("%d", &N); ) {
    for (int x = 0; x < N; ++x) {
      scanf("%s", S[x]);
    }
    A.resize(N); for (int x = 0; x < N; ++x) scanf("%d", &A[x]);
    B.resize(N); for (int y = 0; y < N; ++y) scanf("%d", &B[y]);
    
    const bool res = solve();
    if (!res) {
      puts("No");
    }
  }
  return 0;
}