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

using ll=long long;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using P=pair<int,int>;
using vi=vc<int>;


void solve(){
	int n;
	cin>>n;
	vc<string> mp(n);
	vc<int> R(n),C(n);
	for(int i=0;i<n;i++) cin>>mp[i];
	for(int i=0;i<n;i++) cin>>R[i];
	for(int i=0;i<n;i++) cin>>C[i];
	vc<vc<int>> ans(n,vc<int>(n));
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(mp[i][j]=='-'){
				ans[i][j]=1;
				R[i]++,C[j]++;
			}
		}
	}
	for(int i=0;i<n;i++){
		if(R[i]<0||C[i]<0){
			cout<<"No"<<endl;
			return;
		}
	}
	for(int i=0;i<n;i++){
		vc<P> vec(n);
		for(int j=0;j<n;j++) vec[j]=P(C[j],j);
		sort(vec.begin(),vec.end());
		for(int j=0;j<n;j++){
			P p=vec[n-j-1];
			if(p.a>0&&R[i]>0){
				ans[i][p.b]^=1;
				R[i]--,C[p.b]--;
			}
		}
		if(R[i]>0){
			cout<<"No"<<endl;
			return;
		}
	}
	for(int i=0;i<n;i++){
		if(C[i]>0){
			cout<<"No"<<endl;
			return;
		}
	}
	cout<<"Yes"<<endl;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++) cout<<ans[i][j];
		cout<<endl;
	}
}
int main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int T=1;
	while(T--) solve();
}