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

using namespace std;

int main()
{
  int n, k;
  cin >> n >> k;
  vector<vector<string>> s(k), t(k);
  for (int i = 0; i < n; ++i)
  {
    string ss;
    cin >> ss;
    s[i % k].push_back(ss);
  }
  for (int i = 0; i < n; ++i)
  {
    string tt;
    cin >> tt;
    t[i % k].push_back(tt);
  }
  for (int i = 0; i < k; ++i)
  {
    sort(s[i].begin(), s[i].end());
    sort(t[i].begin(), t[i].end());
  }
  int ans = 1;
  for (int i = 0; i < k; ++i)
  {
    if (s[i] != t[i])
    {
      ans = 0;
      break;
    }
  }
  cout << (ans ? "Yes" : "No") << endl;
}