#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
const int MAXN=4005;
int n,a[MAXN],b[MAXN];char c[MAXN][MAXN];
bool ans[MAXN][MAXN];
int main(){
	ios::sync_with_stdio(false);
	// freopen("Otomachi_Una.in","r",stdin);
	// freopen("Otomachi_Una.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++){
		cin>>c[i][j];
	}
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) cin>>b[i];
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++){
		if(c[i][j]=='-') a[i]++,b[j]++,ans[i][j]=true;
	}
	int sum=0;
	for(int i=1;i<=n;i++) if(a[i]<0||b[i]<0||a[i]>n||b[i]>n){
		cout<<"No\n";return 0;
	}else sum+=a[i]-b[i];
	if(sum!=0){cout<<"No\n";return 0;}
	vector<int> idx;
	for(int i=1;i<=n;i++) idx.push_back(i);
	sort(idx.begin(),idx.end(),[&](int x,int y){return a[x]<a[y];});
	for(int i:idx){
		vector<int> idx;
		for(int i=1;i<=n;i++) idx.push_back(i);
		sort(idx.begin(),idx.end(),[&](int x,int y){return b[x]>b[y];});
		for(int j=0;j<a[i];j++){
			if(b[idx[j]]) ans[i][idx[j]]^=1,b[idx[j]]--;
			else{cout<<"No\n";return 0;}
		} 
	}
	cout<<"Yes\n";
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++) cout<<ans[i][j];
		cout<<'\n';
	}
	return 0;
}