#include <iostream>
#include <vector>
#include <string>
#include <optional>
#include <stdexcept>
#include <sstream>
#include <chrono>
#include <cstdlib> //rand()を使うために必要
#include <time.h>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>

using namespace std;

template <typename T>
bool next_combination(const T first, const T last, int k)
{
    const T subset = first + k;
    // empty container | k = 0 | k == n
    if (first == last || first == subset || last == subset)
    {
        return false;
    }
    T src = subset;
    while (first != src)
    {
        src--;
        if (*src < *(last - 1))
        {
            T dest = subset;
            while (*src >= *dest)
            {
                dest++;
            }
            iter_swap(src, dest);
            std::rotate(src + 1, dest + 1, last);
            std::rotate(subset, subset + (last - dest) - 1, last);
            return true;
        }
    }
    // restore
    std::rotate(first, subset, last);
    return false;
}

void solve()
{
    int N, K;
    cin >> N >> K;
    vector<string> S_vec(N);
    vector<string> T_vec(N);
    for (int i = 0; i < N; i++)
        cin >> S_vec[i];
    for (int i = 0; i < N; i++)
        cin >> T_vec[i];

    vector<multiset<string>> S_set(K, multiset<string>{});
    vector<multiset<string>> T_set(K, multiset<string>{});

    for (int i = 0; i < N; i++)
    {
        S_set[i % K].insert(S_vec[i]);
        T_set[i % K].insert(T_vec[i]);
    }
    for (int k = 0; k < K; k++)
    {
        vector<string> S_check(S_set[k].begin(), S_set[k].end());
        vector<string> T_check(T_set[k].begin(), T_set[k].end());
        for (int i = 0; i < S_check.size(); i++)
        {
            if (S_check[i] != T_check[i])
            {
                cout << "No" << endl;
                return;
            }
        }
    }
    cout << "Yes" << endl;
}

void check_sw()
{
    // cout << "評価値算出=" << get_sum_time(eval_calculation_sw) / cnt_eval << endl;
}

int main()
{
    solve();
    // test();
    // check_sw();
}