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

using namespace std;

constexpr int N = 4032;

bitset<N> edge[2][N], ans[N], used[2], neg[2];
int rt[N], ct[N], n;

template <bool col>
bool match(int i) {
  while (1) {
    int j = (edge[col][i] & neg[!col])._Find_first();
    if (j == N) break;
    edge[col][i][j] = 0;
    edge[!col][j][i] = 1;
    if (col) {
      ans[j][i] = !ans[j][i];
      neg[0][j] = ++rt[j] < 0;
    } else {
      ans[i][j] = !ans[i][j];
      neg[1][j] = ++ct[j] < 0;
    }
    return 1;
  }
  used[col][i] = 1;
  while (1) {
    int j = (edge[col][i] & ~used[!col])._Find_first();
    if (j == N) break;
    if (!match<!col>(j)) continue;
    edge[col][i][j] = 0;
    edge[!col][j][i] = 1;
    if (col) ans[j][i] = !ans[j][i];
    else ans[i][j] = !ans[i][j];
    return 1;
  }
  return 0;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 0; i < n; ++i) if (string s; cin >> s)
  for (int j = 0; j < n; ++j) edge[1][j][i] = !(edge[0][i][j] = s[j] == '+');
  for (int i = 0; i < n; ++i) cin >> rt[i], neg[0][i] = rt[i] < 0;
  for (int i = 0; i < n; ++i) cin >> ct[i], ct[i] = -ct[i], neg[1][i] = ct[i] < 0;
  for (int ch = 1; ch--; ) {
    for (int i = 0; i < n; ++i) while (rt[i] > 0 && !used[0][i] && match<0>(i)) --rt[i], ch = 1;
    for (int j = 0; j < n; ++j) while (ct[j] > 0 && !used[1][j] && match<1>(j)) --ct[j], ch = 1;
    used[0] = used[1] = {};
  }
  for (int i = 0; i < n; ++i) if (rt[i] || ct[i]) return cout << "No\n", 0;
  cout << "Yes\n";
  for (int i = 0; i < n; ++i, cout << '\n')
  for (int j = 0; j < n; ++j) cout.put('0' + ans[i][j]);
}