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

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];
  map<string, int> tpos;
  for (int i = 0; i < n; i++) tpos[t[i]] = i;
  for (int i = 0; i < n; i++) {
    const auto it = tpos[s[i]];
    const auto diff = abs(it - i);
    if (diff % k != 0) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  return 0;
}