#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
#include <atcoder/string>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

int main(){
    int N; cin >> N;
    int K; cin >> K;
    vector<int> A(N); rep(i,N) cin >> A[i];
    vector<int> B(N); rep(i,N) cin >> B[i];
    vector<int> sA = A; sort(sA.begin(), sA.end());
    vector<int> sB = B; sort(sB.begin(), sB.end());
    bool ans = false;
    if(K > N){
        ans = (A == B);
    }
    else if(sA != sB){
        ans = false;
    }
    else if(K == N){
        rep(t,2){
            if(A == B) ans = true;
            reverse(A.begin(), A.end());
        }
    }
    else if(K <= N-2){
        ans = true;
    }
    else{
        auto judge = [&ans](vector<int> A, vector<int> B){
            int n = A.size();
            vector<int> BAA(n*3);
            rep(i,n) BAA[n+i] = BAA[n+n+i] = A[i];
            rep(i,n) BAA[i] = B[i];
            auto Z = atcoder::z_algorithm(BAA);
            if(n % 2 == 1){
                for(int i=n; i<2*n; i++) if(Z[i] >= n) ans = true;
            } else {
                for(int i=n; i<2*n; i+=2) if(Z[i] >= n) ans = true;
            }
        };
        rep(y,2){
            rep(u,2) rep(v,2){
                rep(s,2) rep(t,2){
                    judge(A, B);
                    reverse(A.begin() + s, A.begin() + (N-1+s));
                }
                reverse(B.begin() + u, B.begin() + (N-1+u));
            }
            reverse(A.begin(), A.end());
        }
    }

    cout << (ans ? "Yes\n" : "No\n");
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;