#include<bits/stdc++.h>
using namespace std;
using ll=long long;

void solve(){
	ll N,K;
	cin>>N>>K;
	vector<vector<string>> S(K),T(K);
	for(int i=0;i<N;i++){
		string s;
		cin>>s;
		S[i%K].push_back(s);
	}
	for(int i=0;i<N;i++){
		string s;
		cin>>s;
		T[i%K].push_back(s);
	}
	for(int i=0;i<K;i++){
		sort(S[i].begin(),S[i].end());
		sort(T[i].begin(),T[i].end());
		if(S[i]!=T[i]){
			cout<<"No"<<endl;
			return;
		}
	}
	cout<<"Yes"<<endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	
	ll T=1;
	// cin>>T;
	while(T--)
	solve();

}