/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1e6+10;
int h,w;
char s[24][24];
int r[24],c[24],r_it,c_it;
int ur[24],uc[24];
void dfs(int r_id,int c_id){
    if(r_id==h&&c_id==w){
        W("YES");
        exit(0);
    }
    if(h-r_id>w-c_id){
        if(ur[r_id]){
            dfs(r_id+1,c_id);
            return;
        }
        if(h%2&&r[h/2]==-1){
            bool err=0;
            REP(j,c_it){
                if(s[r_id][c[j]]!=s[r_id][c[w-1-j]]){
                    err=1;
                    break;
                }
            }
            if(!err){
                r[h/2]=r_id;
                dfs(r_id+1,c_id);
                r[h/2]=-1;
            }
        }
        if(r_it==h/2)return;
        REPP(i,r_id+1,h){
            if(ur[i])continue;
            if((w&1)&&c[w/2]!=-1 &&s[r_id][c[w/2]]!=s[i][c[w/2]])continue;
            bool err=0;
            REP(j,c_it){
                if(s[r_id][c[j]]!=s[i][c[w-1-j]]){
                    err=1;
                    break;
                }
                if(s[r_id][c[w-1-j]]!=s[i][c[j]]){
                    err=1;
                    break;
                }
            }
            if(!err){
                r[r_it]=r_id;
                ur[i]=1;
                r[h-1-r_it]=i;
                r_it++;
                dfs(r_id+1,c_id);
                r_it--;
                ur[i]=0;
                r[r_it]=-1;
                r[h-1-r_it]=-1;
            }
        }
    }
    else{
        if(uc[c_id]){
            dfs(r_id,c_id+1);
            return;
        }
        if(w%2&&c[w/2]==-1){
            bool err=0;
            REP(j,r_it){
                if(s[r[j]][c_id]!=s[r[h-1-j]][c_id]){
                    err=1;
                    break;
                }
            }
            if(!err){
                c[w/2]=c_id;
                dfs(r_id,c_id+1);
                c[w/2]=-1;
            }
        }
        if(c_it==w/2)return;
        REPP(i,c_id+1,w){
            if(uc[i])continue;
            if((h&1)&&r[h/2]!=-1 &&s[r[h/2]][c_id]!=s[r[h/2]][i])continue;
            bool err=0;
            REP(j,r_it){
                if(s[r[j]][c_id]!=s[r[h-1-j]][i]){
                    err=1;
                    break;
                }
                if(s[r[h-1-j]][c_id]!=s[r[j]][i]){
                    err=1;
                    break;
                }
            }
            if(!err){
                c[c_it]=c_id;
                c[w-1-c_it]=i;
                uc[i]=1;
                c_it++;
                dfs(r_id,c_id+1);
                c_it--;
                uc[i]=0;
                c[c_it]=-1;
                c[w-1-c_it]=-1;
            }
        }
    }
}
int main(){
    MS1(r);
    MS1(c);
    R(h,w);
    REP(i,h)RS(s[i]);
    if(h==1||w==1){
        int cnt[26]={};
        REP(i,h)REP(j,w){
            cnt[s[i][j]-'a']++;
        }
        int odd=0;
        REP(i,26){
            if(cnt[i]&1)odd++;
        }
        W(odd<=1?"YES":"NO");
        return 0;
    }
    dfs(0,0);
    W("NO");
    return 0;
}


Measured memory_bytes: 256