#include <algorithm>
#include <cstdint>
#include <iostream>
#include <tuple>
#include <vector>

using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, i; cin >> n;
  vector<string> v(n);
  for (auto& s: v) cin >> s;
  vector<tuple<int, int>> r(n), c(n), t(n);
  i = 0; for (auto& [R, j]: r) cin >> R, j = i++;
  i = 0; for (auto& [C, j]: c) cin >> C, j = i++;
  for (auto& [r, i]: r)
  for (auto& [c, j]: c) if (v[i][j] == '-') ++r, ++c;
  sort(r.rbegin(), r.rend());
  sort(c.rbegin(), c.rend());
  for (auto [x, i]: r) {
    int a = 0, b = 0;
    for (auto [y, j]: c) if (x > 0) v[i][j] ^= 6, t[a++] = {y - 1, j}, --x; else c[b++] = {y, j};
    if (x || get<0>(t[a - 1]) < 0) return cout << "No\n", 0;
    copy((uint64_t*)&t[0], (uint64_t*)&t[a], (uint64_t*)&c[b]);
    inplace_merge((uint64_t*)&c[0], (uint64_t*)&c[b], (uint64_t*)&c[n], greater{});
  }
  if (get<0>(c[0]) || get<0>(c[n - 1])) return cout << "No\n", 0;
  cout << "Yes\n";
  for (auto& s: v) { for (auto& c: s) c = c == '-'? '1': '0'; cout << s << '\n'; }
}