#include <algorithm>
#include <array>
#include <iostream>
#include <vector>

using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  vector<string> v(n);
  for (auto& s: v) cin >> s;
  vector<array<int, 2>> r(n), c(n), t(n);
  for (int i = 0; auto& [r, j]: r) cin >> r, j = i++;
  for (int i = 0; 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.begin(), r.end());
  sort(c.begin(), c.end());
  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};
    copy(t.begin(), t.begin() + a, c.begin() + b);
    inplace_merge(c.begin(), c.begin() + b, c.end());
    if (x || c[n - 1][0] > 0) return cout << "No\n", 0;
  }
  cout << "Yes\n";
  for (auto& s: v) { for (auto& c: s) c = c == '+'? '1': '0'; cout << s << '\n'; }
}