#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, l, r) for(ll i = l; i < r; ++i)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, auto b) {return a > b ? a = b, 1 : 0;}
bool chmax(auto &a, auto b) {return a < b ? a = b, 1 : 0;}

struct IOSetup {
  IOSetup() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template<class T>
void print(vector<T> a) {
  for(auto x : a) cout << x << ' ';
  cout << endl;
}

void print(auto x) {cout << x << endl;}

template<class Head, class...Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head << ' ';
  pritn(forward<Tail>(tail)...);
}

int main(){
  int n;
  cin>>n;
  vector<string>S(n);
  rep(i,n)cin>>S[i];
  vi row(n),col(n);
  rep(i,n)cin>>row[i];
  rep(i,n)cin>>col[i];

  {
    int sm1=0,sm2=0;
    rep(i,n){
      sm1+=row[i];
      sm2+=col[i];
    }
    if(sm1!=sm2){
      cout<<"No"<<endl;
      exit(0);
    }
  }

  rep(i,n)rep(j,n){
    if(S[i][j]=='-'){
      row[i]++;
      col[j]++;
    }
  }

  vvi use(n,vi(n,0));
  vector<pair<int,int>>res;
  rep(i,n)res.push_back({row[i],i});
  sort(res.rbegin(),res.rend());
  for(auto [sz,x]:res){
    vector<pair<int,int>>cand;
    rep(y,n){
      if(col[y]>0)cand.push_back({col[y],y});
    }
    if(cand.size()<sz){
      cout<<"No"<<endl;
      exit(0);
    }
    sort(cand.rbegin(),cand.rend());
    rep(i,sz){
      auto [_,y]=cand[i];
      use[x][y]=1;
      col[y]--;
    }
  }
  vector<string>ans(n,string(n,'?'));
  rep(i,n)rep(j,n){
    if(S[i][j]=='+'){
      if(use[i][j]==1)ans[i][j]='1';
      else ans[i][j]='0';
    }
    else{
      if(use[i][j]==1)ans[i][j]='0';
      else ans[i][j]='1';
    }
  }
  cout<<"Yes"<<endl;
  rep(i,n){
    cout<<ans[i]<<endl;
  }
}