#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_set>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(1) cerr

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;

void die() {
  cout << "No\n";
  exit(0);
}

void solve() {
  int n;
  cin >> n;
  vector<vector<bool>> keep(n);
  vector<string> g(n);
  vector<int> rsum(n), csum(n);
  for(int i = 0; i < n; i++) {
    cin >> g[i];
    keep[i].resize(n);
    for(int j = 0; j < n; j++) {
      keep[i][j] = g[i][j] == '+';
      rsum[i] += keep[i][j];
      csum[j] += keep[i][j];
    }
  }
  vector<int> wantr(n), wantc(n);
  for(auto& x: wantr) cin >> x;
  for(auto& x: wantc) cin >> x;
  for(int i = 0; i < n; i++) {
    if(wantr[i] > rsum[i]) {
      die();
    }
    vector<array<int, 2>> complement;
    for(int j = 0; j < n; j++) {
      if(wantc[j] > csum[j]) die();
      if(wantc[j] == csum[j]) continue;
      complement.pb({csum[j] - wantc[j], j});
    }
    sort(all(complement));
    int take = rsum[i] - wantr[i];
    while(take-- > 0) {
      if(sz(complement) == 0) die();
      auto [_, idx] = complement.back();
      complement.pop_back();
      keep[i][idx] = !keep[i][idx];
      rsum[i]--; csum[idx]--;
    }
  }
  if(rsum != wantr || csum != wantc) die();
  cout << "Yes\n";
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) cout << "01"[keep[i][j]];
    cout << "\n";
  }
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}