#include<bits/stdc++.h>
#define P make_pair 
using namespace std;
bool res[4001][4001];
int z[4001],h[4001];
int pos[4001],n;
vector<int> vec;
bool comp(int x,int y)
{
	return z[x]<z[y];
}
priority_queue<pair<int,int> >pq;  
signed main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=n;++j)
		{
			char c;
			cin>>c;
			if(c=='+') res[i][j]=false;
			else res[i][j]=true;
		}
	}
	for(int i=1;i<=n;++i) scanf("%d",&z[i]),pos[i]=i;
	for(int i=1;i<=n;++i) scanf("%d",&h[i]);
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=n;++j)
		{
			if(res[i][j]==true)
			{
				z[i]++;
				h[j]++;
			}
		}
	}
	for(int i=1;i<=n;++i) pq.push(P(h[i],i));
	sort(pos+1,pos+1+n,comp);
	for(int i=1;i<=n;++i)
	{
		vec.clear();
		while(z[pos[i]]--)
		{
			int x=pq.top().second;
			pq.pop(); 
			h[x]--;
			res[pos[i]][x]^=1;
			vec.push_back(x);
		}
		for(int j=0;j<vec.size();++j) pq.push(P(h[vec[j]],vec[j]));
	}
	for(int i=1;i<=n;++i)
	{
		if(h[i])
		{
			cout<<"No";
			return 0;
		}
	}
	cout<<"Yes\n";
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=n;++j)
		{
			if(res[i][j]) cout<<"1";
			else cout<<"0";
		 } 
		 cout<<endl;
	}
}