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

template <class T>
vector<int64_t> zalgo(vector<T> &s) {
    int64_t N = s.size();
    vector<int64_t> res(N);
    res[0] = 0;
    for (int64_t i = 1, j = 0; i < N; i++) {
        int64_t& k = res[i];
        k = (i < j + res[j]) ? min(j + res[j] - i, res[i - j]) : 0;
        while (i + k < N and s[k] == s[i + k]) k++;
        if (j + res[j] < i + res[i]) j = i;
    }
    res[0] = N;
    return res;
}

int main(){
    int64_t N, K; cin >> N >> K;
    vector<int64_t> A(N), B(N);
    for(auto &a : A) cin >> a;
    for(auto &b : B) cin >> b;
    
    if(K > N){
        cout << (A == B ? "Yes" : "No") << '\n';
        return 0;
    }
    if(K == N){
        vector<int64_t> C = A;
        reverse(C.begin(), C.end());
        cout << (A == B or C == B ? "Yes" : "No") << '\n';
        return 0;
    }
    if(K == N-1){
        vector<int64_t> BAA = B;
        for(auto a : A) BAA.push_back(-1);
        for(auto a : A) BAA.push_back(a);
        for(auto a : A) BAA.push_back(a);
        auto Z_BAA = zalgo<int64_t>(BAA);
        for(int64_t i = 2*N; i < 3*N; i++){
            if(Z_BAA[i] >= N){
                cout << "Yes" << '\n';
                return 0;
            }
        }
        reverse(B.begin(), B.end());
        BAA = B;
        for(auto a : A) BAA.push_back(-1);
        for(auto a : A) BAA.push_back(a);
        for(auto a : A) BAA.push_back(a);
        Z_BAA = zalgo<int64_t>(BAA);
        for(int64_t i = 2*N; i < 3*N; i++){
            if(Z_BAA[i] >= N){
                cout << "Yes" << '\n';
                return 0;
            }
        }
        cout << "No" << '\n';
        return 0;
    }
    if(K < N-1){
        vector<int64_t> C = A, D = B;
        sort(C.begin(), C.end());
        sort(D.begin(), D.end());
        cout << (C == D ? "Yes" : "No") << '\n';
        return 0;
    }
}