#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
mint op(mint a, mint b) { return a + b; }
mint e() { return 0; }
struct Rollinghash {
	Rollinghash(int _base, vector<int>v) {
		base = _base + 10;
		inv = base.inv();
		sz = v.size() * 2;
		vector<mint>mv(sz);
		mint pw = 1;
		rrep(i, v.size() * 2) {
			mv[i] = (v[i%v.size()] + 1)*pw;
			pw *= base;
		}
		seg = segtree<mint, op, e>(mv);
	}
	mint get(int l, int r) {
		auto get = seg.prod(l, r);
		get *= inv.pow(sz - r);
		return get;
	}
	int sz;
	mint base;
	mint inv;
	segtree<mint, op, e> seg;
};
bool equal(vector<int>a, vector<int>b) {
	return a == b;
}
bool sort(vector<int>a, vector<int>b) {
	sort(all(a));
	sort(all(b));
	return a == b;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<int>a(n), b(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	if (equal(a, b)) {
		cout << "Yes" << endl;
		return 0;
	}
	if (!sort(a, b)) {
		cout << "No" << endl;
		return 0;
	}
	if (k > n) {
		cout << "No" << endl;
		return 0;
	}
	else if (k == n) {
		reverse(all(b));
		if (a == b)cout << "Yes" << endl;
		else cout << "No" << endl;
		return 0;
	}
	else if (k == n - 1) {
		Rollinghash rh(200000, a);
		reverse(all(a));
		Rollinghash rhR(200000, a);
		reverse(all(a));
		Rollinghash rhb(200000, b);
		auto hsb = rhb.get(0, n);
		bool chk = false;
		rep(i, n) {
			auto get1 = rh.get(i, i + n);
			if (get1 == hsb)chk = true;
			auto get2 = rhR.get(i, i + n);
			if (get2 == hsb)chk = true;
		}
		if (chk)cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	else {
		cout << "Yes" << endl;
		return 0;
	}
	return 0;
}