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

int main() {
    int N, K;
    cin >> N >> K;

    vector<string> S(N), T(N);
    for (int i = 0; i < N; ++i) cin >> S[i];
    for (int i = 0; i < N; ++i) cin >> T[i];

    vector<multiset<string>> groupS(K), groupT(K);

    for (int i = 0; i < N; ++i) {
        groupS[i % K].insert(S[i]);
        groupT[i % K].insert(T[i]);
    }

    bool ok = true;
    for (int i = 0; i < K; ++i) {
        if (groupS[i] != groupT[i]) {
            ok = false;
            break;
        }
    }

    cout << (ok ? "Yes" : "No") << '\n';
    return 0;
}