#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, k;
  cin >> n >> k;
  vector<string> s(n);
  rep(i, n) cin >> s[i];
  vector<string> t(n);
  rep(i, n) cin >> t[i];
  bool ok = true;
  rep(ki, k) {
    set<string> st;
    for (ll i = ki; i < n; i += k)
      st.insert(s[i]);
    for (ll i = ki; i < n; i += k) {
      ok &= st.count(t[i]) == 1;
      st.erase(t[i]);
    }
  }
  cout << (ok ? "Yes" : "No") << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}