#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
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<vector<string>> groupS(K), groupT(K);
    for (int i = 0; i < N; ++i) {
        groupS[i % K].push_back(S[i]);
        groupT[i % K].push_back(T[i]);
    }

    for (int r = 0; r < K; ++r) {
        sort(groupS[r].begin(), groupS[r].end());
        sort(groupT[r].begin(), groupT[r].end());
        if (groupS[r] != groupT[r]) {
            cout << "No" << endl;
            return 0;
        }
    }

    cout << "Yes" << endl;
    return 0;
}