#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

bool can_transform(int N, int K, const vector<string>& S, const vector<string>& T) {
    vector<vector<string>> groups_S(K), groups_T(K);

    // Group elements by index % K
    for (int i = 0; i < N; ++i) {
        groups_S[i % K].push_back(S[i]);
        groups_T[i % K].push_back(T[i]);
    }

    // Sort each group and compare
    for (int i = 0; i < K; ++i) {
        sort(groups_S[i].begin(), groups_S[i].end());
        sort(groups_T[i].begin(), groups_T[i].end());
        if (groups_S[i] != groups_T[i]) {
            return false;
        }
    }

    return true;
}

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];
    }

    if (can_transform(N, K, S, T)) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }

    return 0;
}