#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > piii;
typedef long long ll;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


int main() {
    ios::sync_with_stdio(0);cin.tie(0);
    cin >> n >> m;
    map<int, vector<string> > ma, mb;
    string s;
    for (int i = 1; i < n + 1; i++) cin >> s, ma[i % m].push_back(s);
    for (int i = 1; i < n + 1; i++) cin >> s, mb[i % m].push_back(s);
    for (auto& u : ma) sort(u.second.begin(), u.second.end());
    for (auto& u : mb) sort(u.second.begin(), u.second.end());
    for (auto& u : ma) {
        if (mb[u.first] != u.second) {
            puts("No");
            return 0;
        }
    }
    puts("Yes");
    return 0;
}