#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct IOST {
	IOST() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(20);
	}
} IOST;

void solve() {
	int n, k;
	cin >> n >> k;
	vector<set<string>> s(k);
	rep(i, 0, n) {
		string t;
		cin >> t;
		s[i % k].insert(t);
	}
	rep(i, 0, n) {
		string t;
		cin >> t;
		s[i % k].erase(t);
	}
	rep(i, 0, k) if (!s[i].empty()) {
		cout << "No\n";
		return;
	}
	cout << "Yes\n";
}

int main() {
	int t = 1;
	// cin >> t;
	rep(i, 0, t) solve();
}