#include<bits/stdc++.h>

using namespace std;
//#define int long long
typedef long long LL;
#define ii __int128
#define endl '\n'
const int M=20000;
#define mp make_pair
#define pr pair<int,int>
const int mod=1e9+7;
mt19937 rd(time(NULL));

void solve()
{
	int n;
	cin>>n;
	vector<string> t(n);
	vector<vector<int>> ok(n,vector<int>(n));
	for(int i=0;i<n;i++) 
	{
		cin>>t[i];
	}
	vector<int> h(n),l(n);
	for(int i=0;i<n;i++) cin>>h[i];
	for(int i=0,a;i<n;i++)
	{
		cin>>l[i];
	}
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(t[i][j]=='-') ok[i][j]=1,h[i]++,l[j]++;
	vector<pair<int,int>> q;
	for(int i=0;i<n;i++) if(l[i]) q.push_back(mp(l[i],i));
	for(int i=0;i<n;i++)
	{
		if(!h[i]) continue;
		int num=h[i];
		if(num>q.size()||num<0)
		{
			cout<<"NO"<<endl;
			return ;
		}
		sort(q.begin(),q.end(),greater<pair<int,int>>());
		for(auto it=q.begin();it!=q.end();)
		{
			ok[i][it->second]=ok[i][it->second]^true;
			it->first--;
			if(!(it->first)) 
			{
				it=q.erase(it);
			}else it++;
			num--;
			if(!num) break;
		}
	}
	if(!q.empty())
	{
		cout<<"NO"<<endl;
		return ;
	}
	cout<<"YES"<<endl;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++) cout<<ok[i][j];cout<<endl;
	}
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int T;
	T=1;
	while(T--) solve();
}