/**
	author:  shobonvip
	created: 2025.04.19 22:46:03
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, k; cin >> n >> k;
	vector<string> s(n);
	map<string,int> taio;
	rep(i,0,n){
		cin>>s[i];
		taio[s[i]]=i;
	}

	vector<string> t(n);
	vector<int> p(n);
	rep(i,0,n){
		cin>>t[i];
		p[i]=taio[t[i]];
	}

	vector<vector<int>> bucket1(k,vector<int>(0));
	vector<vector<int>> bucket2(k,vector<int>(0));
	rep(i,0,n){
		bucket1[i%k].push_back(p[i]);
		bucket2[i%k].push_back(i);
	}
	bool mode=1;
	rep(i,0,k){
		sort(all(bucket1[i]));
		sort(all(bucket2[i]));
		if(bucket1[i]!=bucket2[i]){
			mode=0;
			break;
		}
	}
	if(mode){
		cout<<"Yes\n";
	}else{
		cout<<"No\n";
	}
}