#include <bits/stdc++.h>
#include <atcoder/all>
// url 
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=b-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x);
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double lld;
using namespace std;
using namespace atcoder;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const string zton="0123456789";
const string atoz="abcdefghijklmnopqrstuvwxyz";
const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ll inf=(1ll<<60);
// const int inf=(1<<30);
lld dist(lld x1,lld x2,lld y1,lld y2){
    lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    res=sqrt(abs(res));
    return res;
}
lld arg(lld x,lld y){
    const lld eps=1e-8;
    lld res=0;
    if(abs(x)+abs(y)<=eps)return 0.0;
    else if(abs(x)<=eps){
        if(y>=0.0)return (M_PI/2);
        else return (M_PI/2+M_PI);
    }
    else if(abs(y)<=eps){
        if(x>=0.0)return 0.0;
        else return M_PI;
    }
    res=atan2(abs(y),abs(x));
    if(x<=0&&y>=0)res=(M_PI-res);
    else if(x<=0&&y<=0)res+=(M_PI);
    else if(x>=0&&y<=0)res=(M_PI*2-res);
    return res;
}
ll gcd(ll a,ll b){
    if(a==0||b==0)return a+b;
    ll r;
    r=a%b;
    if(r==0){
        return b;
    }
    else{
        return gcd(b,r);
    }
}
typedef pair<ll,int> P;

bool check(vector<int> A,vector<int> B){
    sort(all(A));
    sort(all(B));
    if(A==B)return true;
    else return false;
}

const ll mask61=(1ll<<61)-1;
const ll mod=mask61;
const ll mask30=(1ll<<30)-1;
const ll mask31=(1ll<<31)-1;

const int hash_size=201010;
ll unit_hash[hash_size];
ll base=10;
// ll inv_base=inv_mod(base,mod);
ll inv_base=2075258708292324556; // mod=mask61,base=10
const int string_size=401010;
ll power_base[string_size];
ll power_base_inv[string_size];

// return a%mod
ll CalcMod(ll x)
{
    ll xu = x >> 61;
    ll xd = x & mask61;
    ll res = xu + xd;
    if (res >= mod) res -= mod;
    return res;
}

// return a*b%mod
ll MulMod(ll a, ll b)
{
    ll au = a >> 31;
    ll ad = a & mask31;
    ll bu = b >> 31;
    ll bd = b & mask31;
    ll mid = ad * bu + au * bd;
    ll midu = mid >> 30;
    ll midd = mid & mask30;
    return CalcMod(au * bu * 2 + midu + (midd << 31) + ad * bd);
}

void Init(){
    rep(i,0,hash_size){
        unit_hash[i]=random()%mod;
    }
    power_base[0]=1;
    rep(i,1,string_size){
        power_base[i]=MulMod(power_base[i-1],base);
    }
    power_base_inv[0]=1;
    rep(i,1,string_size){
        power_base_inv[i]=MulMod(power_base_inv[i-1],inv_base);
    }
}

// return hashvector
vector<ll> HashVector(vector<int> &v){
    int n=v.size();
    vector<ll> res;
    res.pb(0);
    ll now=0;
    rep(i,0,n){
        now+=MulMod(unit_hash[v.at(i)],power_base[i]);
        now%=mod;
        res.pb(now);
    }
    return res;
}

ll GetHashNumber(int l,int r,vector<ll> &v){
    ll res=v[r]-v[l];
    res+=mod;
    res%=mod;
    res=MulMod(res,power_base_inv[l]);
    return res;
}

int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,k;
    cin>>N>>k;
    vector<int> A(N);
    rep(i,0,N)cin>>A[i];
    vector<int> B(N);
    rep(i,0,N)cin>>B[i];
    if(k>N){
        if(A==B){
            cout<<"Yes"<<endl;
            return 0;
        }
        else{
            cout<<"No"<<endl;
            return 0;
        }
    }
    else if(k==N){
        if(A==B){
            cout<<"Yes"<<endl;
            return 0;
        }
        reverse(all(A));
        if(A==B){
            cout<<"Yes"<<endl;
            return 0;
        }
        else{
            cout<<"No"<<endl;
            return 0;
        }
    }
    else if(k<=N-2){
        if(check(A,B)){
            cout<<"Yes"<<endl;
            return 0;
        }
        else{
            cout<<"No"<<endl;
            return 0;
        }
    }
    Init();
    vector<ll> hashB=HashVector(B);
    ll ans=GetHashNumber(0,N,hashB);
    vector<int> A2;
    rep(j,0,2){
        rep(i,0,N){
            A2.pb(A[i]);
        }
    }
    vector<ll> hashA2=HashVector(A2);
    rep(i,0,N){
        ll now=GetHashNumber(i,i+N,hashA2);
        if(now==ans){
            cout<<"Yes"<<endl;
            return 0;
        }
    }
    reverse(all(A2));
    hashA2=HashVector(A2);
    rep(i,0,N){
        ll now=GetHashNumber(i,i+N,hashA2);
        if(now==ans){
            cout<<"Yes"<<endl;
            return 0;
        }
    }
    cout<<"No"<<endl;



}