#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

vector<int> f(vector<int> p, int l, int r){
    reverse(p.begin()+l, p.begin()+r);
    return p;
}

void test(int n, int k){
    vector<int> p(n);
    iota(p.begin(), p.end(), 0);
    set<vector<int>> st;
    queue<vector<int>> que;
    auto push = [&](vector<int> v){
        if(st.count(v) == 0){
            que.push(v);
            st.insert(v);
        }
    };
    push(p);
    while(!que.empty()){
        auto v = que.front(); que.pop();
        for(int l = 0; l < n; l++){
            for(int r = l+k; r <= n; r++){
                push(f(v, l, r));
            }
        }
    }
    for(auto v: st) print_vector(v);
    cout << st.size() << endl;
}

bool same_as_multiset(vector<int> a, vector<int> b){
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    return a == b;
}

vector<int> z_algorithm(vector<int> s){
    int n = s.size();
    vector<int> ans(n);
    ans[0] = n;
    int i = 1, j = 0;
    while(i < s.size()){
        while(i+j < s.size() && s[i+j] == s[j]) j++;
        if(j == 0) {
            i++;
            continue;
        }
        ans[i] = j;
        int k = 1;
        while(k < j && ans[k]+k < j){
            ans[i+k] = ans[k];
            k++;
        }
        i += k;
        j -= k;
    }
    return ans;
}

bool is_cyclic_shift(vector<int> a, vector<int> b){
    int n = a.size();
    auto v = b;
    for(int x: a) v.push_back(x);
    for(int x: a) v.push_back(x);
    auto z = z_algorithm(v);
    for(int i = n; i < 2*n; i++){
        if(z[i] >= n) return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k; cin >> n >> k;
    // test(n, k);
    vector<int> a(n), b(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) cin >> b[i];
    if(k <= n-2){
        if(same_as_multiset(a, b)){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }
        return 0;
    }
    if(k > n){
        if(a == b){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }
        return 0;
    }
    if(k == n){
        if(a == b){
            cout << "Yes" << endl;
        }else{
            reverse(b.begin(), b.end());
            if(a == b){
                cout << "Yes" << endl;
            }else{
                cout << "No" << endl;
            }
        }
        return 0;
    }
    if(is_cyclic_shift(a, b)){
        cout << "Yes" << endl;
        return 0;
    }
    reverse(a.begin(), a.end());
    if(is_cyclic_shift(a, b)){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }
}