#include <bits/stdc++.h>
using namespace std;

const int N = 505;

int mod[N * N];
int a[N][N], b[N][N], c[N][N], d[N][N], e[N][N], id[N][N];
char foo[N];
int p[N * N], v1[N * N], v2[N * N], s1[N * N], s2[N * N], nxt[N * N], vis[N * N];
int n, m;

void doit(char op) {
	memset(b, 0, sizeof(b));
	if (op == 'L') {
		for (int i = 1; i <= n; i++) {
			int len = 0;
			for (int j = 1; j <= m; j++) {
				if (a[i][j]) {
					b[i][++len] = a[i][j];
				}
			}
		}
	}
	if (op == 'R') {
		for (int i = 1; i <= n; i++) {
			int len = m + 1;
			for (int j = m; j >= 1; j--) {
				if (a[i][j]) {
					b[i][--len] = a[i][j];
				}
			}
		}
	}
	if (op == 'U') {
		for (int j = 1; j <= m; j++) {
			int len = 0;
			for (int i = 1; i <= n; i++) {
				if (a[i][j]) {
					b[++len][j] = a[i][j];
				}
			}
		}
	}
	if (op == 'D') {
		for (int j = 1; j <= m; j++) {
			int len = n + 1;
			for (int i = n; i >= 1; i--) {
				if (a[i][j]) {
					b[--len][j] = a[i][j];
				}
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			a[i][j] = b[i][j];
		}
	}
}

const char str[4] = {'L', 'D', 'R', 'U'};

void check() {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i][j] != d[i][j]) {
				return;
			}
		}
	}
	printf("yes\n");
	exit(0);
}

int same() {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if ((a[i][j] == 0) != (d[i][j] == 0)) {
				return 0;
			}
		}
	}
	return 1;
}

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%s", foo + 1);
		for (int j = 1; j <= m; j++) {
			if (foo[j] != '.') c[i][j] = foo[j] - 'a' + 1;
		}
	}
		for (int i = 1; i <= n; i++) {
		scanf("%s", foo + 1);
		for (int j = 1; j <= m; j++) {
			if (foo[j] != '.') d[i][j] = foo[j] - 'a' + 1;
		}
	}
	memcpy(a, c, sizeof(a)); check();
	memcpy(a, c, sizeof(a)); doit('L'); check();
	memcpy(a, c, sizeof(a)); doit('D'); check();
	memcpy(a, c, sizeof(a)); doit('R'); check();
	memcpy(a, c, sizeof(a)); doit('U'); check();
	for (int o = 1; o <= 3; o += 2) {
		for (int s = 0; s < 4; s++) {
			memcpy(a, c, sizeof(a));
			int ok = 0, nowd = s;
			for (int _ = 1; _ <= 6; _++) {
				doit(str[nowd]);
				nowd = (nowd + o) % 4;
				if (_ >= 2 && same()) {
					ok = 1;
					break;
				}
				/*
				for (int i = 1; i <= n; i++) {
					for (int j = 1; j <= m; j++) {
						fprintf(stderr, "%d%c", a[i][j], j == m ? '\n' : ' ');
					}
				}
				for (int i = 1; i <= n; i++) {
					for (int j = 1; j <= m; j++) {
						fprintf(stderr, "%d%c", d[i][j], j == m ? '\n' : ' ');
					}
				}
				*/
			}
			if (!ok) continue;
			memcpy(e, a, sizeof(e));
			int tot = 0;
			/*
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					fprintf(stderr, "%d%c", a[i][j], j == m ? '\n' : ' ');
				}
			}
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					fprintf(stderr, "%d%c", d[i][j], j == m ? '\n' : ' ');
				}
			}
			*/
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					if (a[i][j]) {
						++tot;
						v1[tot] = a[i][j];
						v2[tot] = d[i][j];
						a[i][j] = id[i][j] = tot;
					}
				}
			}
			for (int _ = 1; _ <= 4; _++) {
				doit(str[nowd]);
				nowd = (nowd + o) % 4;
			}
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					if (a[i][j]) {
						p[id[i][j]] = a[i][j];
					}
				}
			}
			/*
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= m; j++) {
					fprintf(stderr, "%d%c", a[i][j], j == m ? '\n' : ' ');
				}
			}
			*/
			memset(mod, -1, sizeof(mod));
			memset(vis, 0, sizeof(vis));
			int cando = 1;
			for (int i = 1; i <= tot; i++) {
				if (vis[i]) continue;
				int now = i, len = 0;
				while (!vis[now]) {
					++len;
					s1[len] = v1[now];
					s2[len] = v2[now];
					vis[now] = 1;
					now = p[now];
				}
				for (int j = 2; j <= len; j++) {
					int k = nxt[j - 1];
					while (k && s2[j] != s2[k + 1]) k = nxt[k];
					if (s2[j] == s2[k + 1]) ++k;
					nxt[j] = k;
				}
				/*
				for (int j = 1; j <= len; j++) cerr << s1[j] << ' ';
				for (int j = 1; j <= len; j++) cerr << s2[j] << ' ';
				
				cerr << '\n';
				*/
				int fir = 0, sec = 0, k = 0;
				for (int j = 1; j <= len * 2 - 1; j++) {
					int nowc = (j <= len ? s1[j] : s1[j - len]);
					while (k && nowc != s2[k + 1]) k = nxt[k];
					if (nowc == s2[k + 1]) ++k;
					if (k == len) {
						// cerr << "j = " << j << '\n';
						if (!fir) fir = j;
						else {
							sec = j;
							break;
						}
						k = nxt[k];
					}
				}
				if (!fir) {
					cando = 0;
					break;
				}
				int nn = len, mm = fir - len;
				if (sec) {
					nn = sec - fir;
					mm = fir - len;
					assert(mm < nn);
				}
				for (int p = 2; p <= nn; p++) {
					if (nn % p == 0) {
						int tmp = 1;
						while (nn % p == 0) {
							nn /= p;
							tmp *= p;
							if (mod[tmp] != -1 && mod[tmp] != mm % tmp) {
								cando = 0;
							}
							mod[tmp] = mm % tmp;
						}
					}
				}
				if (!cando) break;
			}
			if (cando) {
				printf("yes\n");
				return 0;
			}
		}
	}
	printf("no\n");
	return 0;
}

/*

4 3
a..
bc.
def
g..

gfd
ce.
b..
a..

*/