#include <bits/stdc++.h>
//#include "atcoder/all"

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")

using namespace std;

using i64 = long long;


void solve(){
  int n, k;
  cin >> n >> k;
  vector<string> s(n);
  for(int i = 0; i < n; ++i){
    cin >> s[i];
  }
  vector<string> t(n);
  for(int i = 0; i < n; ++i){
    cin >> t[i];
  }
  bool flag = true;
  for(int i = 0; i < k; ++i){
    vector<string> s1, s2;
    for(int j = i; j < n; j += k){
      s1.emplace_back(s[j]);
      s2.emplace_back(t[j]);
    }
    sort(s1.begin(), s1.end());
    sort(s2.begin(), s2.end());
    flag &= s1 == s2;
  }
  cout << (flag ? "Yes" : "No") << endl;
}

signed main(){
  solve();
}