#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define ll long long
#define int long long
using namespace std;
using namespace __gnu_pbds;

typedef tree< pair<int,int> , null_type,
			less< pair<int,int> >, splay_tree_tag,
			tree_order_statistics_node_update> PB;

const int maxn = 1010;

int R,C,K;
int ok1[maxn],ok2[maxn];

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	mt19937 mt( (unsigned long long)(new char) );
	
	cin>>R>>C>>K;
	for(int i=1;i<=R;i++)
	{
		string str; cin>>str;
		ok1[i]=1;
		for(int j=1;j<=C;j++)
		{
			if(str[j-1]=='-') ok1[i]=0;
		}
	}
	for(int i=1;i<=R;i++)
	{
		string str; cin>>str;
		for(int j=1;j<=K;j++)
		{
			if(str[j-1]=='*') ok2[i]=1;
		}
	}
	int ok=1;
	for(int i=1;i<=R;i++) if(!ok1[i]&&ok2[i]) ok=0;
	if(ok) cout<<"Y\n";
	else cout<<"N\n";
	
	return 0;
}