#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=550;
int n,m,go[N*N];
char bs[N*N],s[N][N],t[N][N];
bool vis[N*N];
array<int,2> pos[N*N];

typedef pair<int,int> hashv;
const ll mod1=1000000007;
const ll mod2=1000000009;

hashv operator + (hashv a,hashv b) {
	int c1=a.fi+b.fi,c2=a.se+b.se;
	if (c1>=mod1) c1-=mod1;
	if (c2>=mod2) c2-=mod2;
	return mp(c1,c2);
}

hashv operator - (hashv a,hashv b) {
	int c1=a.fi-b.fi,c2=a.se-b.se;
	if (c1<0) c1+=mod1;
	if (c2<0) c2+=mod2;
	return mp(c1,c2);
}

hashv operator * (hashv a,hashv b) {
	return mp(1ll*a.fi*b.fi%mod1,1ll*a.se*b.se%mod2);
}
hashv pw[N*N],base;

typedef pair<ll,ll> PLL;
namespace Factor {
	const int N=1010000;
	ll C,fac[10010],n,mut,a[1001000];
	int T,cnt,i,l,prime[N],p[N],psize,_cnt;
	ll _e[100],_pr[100];
	vector<ll> d;
	inline ll mul(ll a,ll b,ll p) {
		if (p<=1000000000) return a*b%p;
		else if (p<=1000000000000ll) return (((a*(b>>20)%p)<<20)+(a*(b&((1<<20)-1))))%p;
		else {
			ll d=(ll)floor(a*(long double)b/p+0.5);
			ll ret=(a*b-d*p)%p;
			if (ret<0) ret+=p;
			return ret;
		}
	}
	void prime_table(){
		int i,j,tot,t1;
		for (i=1;i<=psize;i++) p[i]=i;
		for (i=2,tot=0;i<=psize;i++){
			if (p[i]==i) prime[++tot]=i;
			for (j=1;j<=tot && (t1=prime[j]*i)<=psize;j++){
				p[t1]=prime[j];
				if (i%prime[j]==0) break;
			}
		}
	}
	void init(int ps) {
		psize=ps;
		prime_table();
	}
	ll powl(ll a,ll n,ll p) {
		ll ans=1;
		for (;n;n>>=1) {
			if (n&1) ans=mul(ans,a,p);
			a=mul(a,a,p);
		}
		return ans;
	}
	bool witness(ll a,ll n) {
		int t=0;
		ll u=n-1;
		for (;~u&1;u>>=1) t++;
		ll x=powl(a,u,n),_x=0;
		for (;t;t--) {
			_x=mul(x,x,n);
			if (_x==1 && x!=1 && x!=n-1) return 1;
			x=_x;
		}
		return _x!=1;
	}
	bool miller(ll n) {
		if (n<2) return 0;
		if (n<=psize) return p[n]==n;
		if (~n&1) return 0;
		for (int j=0;j<=7;j++) if (witness(rand()%(n-1)+1,n)) return 0;
		return 1;
	}
	ll gcd(ll a,ll b) {
		ll ret=1;
		while (a!=0) {
			if ((~a&1) && (~b&1)) ret<<=1,a>>=1,b>>=1;
			else if (~a&1) a>>=1; else if (~b&1) b>>=1;
			else {
				if (a<b) swap(a,b);
				a-=b;
			}
		}
		return ret*b;
	}
	ll rho(ll n) {
		for (;;) {
			ll X=rand()%n,Y,Z,T=1,*lY=a,*lX=lY;
			int tmp=20;
			C=rand()%10+3;
			X=mul(X,X,n)+C;*(lY++)=X;lX++;
			Y=mul(X,X,n)+C;*(lY++)=Y;
			for(;X!=Y;) {
				ll t=X-Y+n;
				Z=mul(T,t,n);
				if(Z==0) return gcd(T,n);
				tmp--;
				if (tmp==0) {
					tmp=20;
					Z=gcd(Z,n);
					if (Z!=1 && Z!=n) return Z;
				}
				T=Z;
				Y=*(lY++)=mul(Y,Y,n)+C;
				Y=*(lY++)=mul(Y,Y,n)+C;
				X=*(lX++);
			}
		}
	}
	void _factor(ll n) {
		for (int i=0;i<cnt;i++) {
			if (n%fac[i]==0) n/=fac[i],fac[cnt++]=fac[i];}
		if (n<=psize) {
			for (;n!=1;n/=p[n]) fac[cnt++]=p[n];
			return;
		}
		if (miller(n)) fac[cnt++]=n;
		else {
			ll x=rho(n);
			_factor(x);_factor(n/x);
		}
	}
	void dfs(ll x,int dep) {
		if (dep==_cnt) d.pb(x);
		else {
			dfs(x,dep+1);
			for (int i=1;i<=_e[dep];i++) dfs(x*=_pr[dep],dep+1);
		}
	}
	void norm() {
		sort(fac,fac+cnt);
		_cnt=0;
		rep(i,0,cnt) if (i==0||fac[i]!=fac[i-1]) _pr[_cnt]=fac[i],_e[_cnt++]=1;
			else _e[_cnt-1]++;
	}
	vector<ll> getd() {
		d.clear();
		dfs(1,0);
		return d;
	}
	vector<ll> factor(ll n) {
		cnt=0;
		_factor(n);
		norm();
		return getd();
	}
	vector<PLL> factorG(ll n) {
		cnt=0;
		_factor(n);
		norm();
		vector<PLL> d;
		rep(i,0,_cnt) d.pb(mp(_pr[i],_e[i]));
		return d;
	}
	bool is_primitive(ll a,ll p) {
		assert(miller(p));
		vector<PLL> D=factorG(p-1);
		a%=p;
		if (a<0) a+=p;
		if (a==0) return 0;
		rep(i,0,SZ(D)) if (powl(a,(p-1)/D[i].fi,p)==1) return 0;
		return 1;
	}
}


bool check() {
	bool vs=1;
	rep(i,0,n) rep(j,0,m) if (s[i][j]!=t[i][j]) vs=0;
	if (vs) return 1;
	bs[0]='.';
	int tot=0;
	vector<VI> lab(n,VI(m,0));
	rep(i,0,n) rep(j,0,m) if (s[i][j]!='.') {
		bs[++tot]=s[i][j];
		lab[i][j]=tot;
	} else {
		lab[i][j]=0;
	}
	auto mov=[&](const vector<VI> &lab,char u) {
		rep(i,0,n) rep(j,0,m) if (lab[i][j]>0) pos[lab[i][j]]={i,j};
		if (u=='L'||u=='R') {
			rep(i,0,n) {
				VI vr;
				rep(j,0,m) if (lab[i][j]!=0) vr.pb(lab[i][j]);
				if (u=='L') {
					rep(j,0,SZ(vr)) pos[vr[j]][1]=j;
				} else {
					rep(j,0,SZ(vr)) pos[vr[j]][1]=m-SZ(vr)+j;
				}
			}
		} else {
			rep(j,0,m) {
				VI vc;
				rep(i,0,n) if (lab[i][j]>0) vc.pb(lab[i][j]);
				if (u=='U') {
					rep(i,0,SZ(vc)) pos[vc[i]][0]=i;
				} else {
					rep(i,0,SZ(vc)) pos[vc[i]][0]=n-SZ(vc)+i;
				}
			}
		}
		vector<VI> nlab(n,VI(m,0));
		rep(i,1,tot+1) nlab[pos[i][0]][pos[i][1]]=i;
		return nlab;
	};
	auto checksm=[&](const vector<VI> &lab) {
		rep(i,0,n) rep(j,0,m) {
			if (bs[lab[i][j]]!=t[i][j]) return false;
		}
		return true;
	};
	auto checksp=[&](const vector<VI> &lab) {
		rep(i,0,n) rep(j,0,m) {
			if ((lab[i][j]==0)!=(t[i][j]=='.')) return false;
		}
		return true;
	};
	auto checkcyc=[&](const vector<VI> &alab,const vector<VI> &blab) {
		rep(i,0,n) rep(j,0,m) {
			assert((alab[i][j]==0)==(blab[i][j]==0));
			go[alab[i][j]]=blab[i][j];
			pos[alab[i][j]]={i,j};
		}
		rep(i,1,tot+1) vis[i]=0;
		map<int,vector<PII>> cs;
		rep(i,1,tot+1) if (!vis[i]) {
			VI cyc;
			int u=i;
			while (!vis[u]) {
				cyc.pb(u); vis[u]=1; u=go[u];
			}
			int l=SZ(cyc);
			string tt;
			for (auto x:cyc) tt.pb(bs[x]);
			hashv ht(0,0);
			for (auto x:cyc) {
				ht=ht*base+mp(t[pos[x][0]][pos[x][1]],t[pos[x][0]][pos[x][1]]);
			}
			hashv hh(0,0);
			rep(i,0,l) hh=hh*base+mp(tt[i],tt[i]);
			hashv ho=hh;
			int bs=-1,cc=l;
			rep(i,0,l) {
				if (hh==ht) bs=i;
				hashv c=mp(tt[i],tt[i]);
				hh=hh*base+c-c*pw[l];
				if (hh==ho) { cc=i+1; break; }
			}
			if (bs==-1) return false;
			auto o=Factor::factorG(cc);
			for (auto [p,e]:o) {
				int pc=1;
				rep(j,0,e) pc=pc*p;
				cs[p].pb(mp(pc,bs%pc));
			}
		}
		for (auto [p,d]:cs) {
			sort(all(d));
			int r=d.back().se;
			for (auto [pc,pr]:d) if (r%pc!=pr) return false;
		}
		return true;
	};
	auto debug=[&](const vector<VI> &lab) {
		rep(i,0,n) {
			rep(j,0,m) putchar(bs[lab[i][j]]);
			puts("");
		}
		//puts("-----");
	};
	auto gao=[&](string op) {
		auto nlab=mov(lab,op[0]);
		if (checksm(nlab)) return true;
		//cout<<op<<"\n";
		//debug(nlab);
		nlab=mov(nlab,op[1]);
		rep(j,0,4) {
			auto clab=nlab;
			if (checksp(clab)) {
				//puts("!!!");
				rep(k,0,4) clab=mov(clab,op[(j+2+k)%4]);
				if (checkcyc(nlab,clab)) return true;
			}
			nlab=mov(nlab,op[(j+2)%4]);
		}
		return false;
	};
	if (gao("ULDR")) return 1;
	if (gao("URDL")) return 1;
	if (gao("DLUR")) return 1;
	if (gao("DRUL")) return 1;
	if (gao("LURD")) return 1;
	if (gao("LDRU")) return 1;
	if (gao("RULD")) return 1;
	if (gao("RDLU")) return 1;
	return 0;
}

int main() {
	Factor::init(250000);
	scanf("%d%d",&n,&m);
	rep(i,0,n) scanf("%s",s[i]);
	rep(i,0,n) scanf("%s",t[i]);
	base=mp(13331,23333);
	pw[0]=mp(1,1);
	rep(i,0,n*m) pw[i+1]=pw[i]*base;
	if (check()) puts("yes"); else puts("no");
}