#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define ALL(a)  (a).begin(),(a).end()
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define repr(i,a,b) for (int i=(int)(a);i>=(int)(b);i--)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
template<class T> void vec_out(vector<T> &a){for(auto &x:a) cout<<x<<" ";cout<<endl;}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}


int main(void) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, k;
    cin >> n >> k;
    vector<string> s(n), t(n);
    rep(i, 0, n) cin >> s[i];
    rep(i, 0, n) cin >> t[i];

    vector<vector<string>> gs(k), gt(k);
    rep(i, 0, n) {
        gs[i % k].push_back(s[i]);
        gt[i % k].push_back(t[i]);
    }
    rep(r, 0, k) {
        sort(ALL(gs[r]));
        sort(ALL(gt[r]));
        if (gs[r] != gt[r]) {
            cout << "No\n";
            return 0;
        }
    }
    cout << "Yes\n";
    return 0;
}