#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

const ll MOD1=1e9+7;
const ll MOD2=1e9+9;
const ll B1=1007;
const ll B2=1009;

bool rolling_hush(vector<ll> &a, vector<ll> &b){
  int al=a.size(),bl=b.size();
  if(al>bl) return false;
  
  ll t1=1,t2=1;
  rep(i,al){
    t1*=B1;
    t2*=B2;
    t1%=MOD1;
    t2%=MOD2;
  }
  
  ll ah=0,bh=0,ch=0,dh=0;
  rep(i,al){
    ah=(ah*B1%MOD1+a[i])%MOD1;
    bh=(bh*B1%MOD1+b[i])%MOD1;
    ch=(ch*B2%MOD2+a[i])%MOD2;
    dh=(dh*B2%MOD2+b[i])%MOD2;
  }
  
  for(int i=0;i+al<=bl;i++){
    if(ah==bh && ch==dh) return true;
    if(i+al<bl){
      bh=(bh*B1%MOD1+b[i+al]-b[i]*t1%MOD1+MOD1)%MOD1;
      dh=(dh*B2%MOD2+b[i+al]-b[i]*t2%MOD2+MOD2)%MOD2;
    }
  }
  return false;
}

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
 
  int n,k;
  cin>>n>>k;
  vector<ll> A(n),B(n);
  multiset<ll> c,d;
  bool b=true;
  rep(i,n){
    cin>>A[i];
    c.insert(A[i]);
  }
  rep(i,n){
    cin>>B[i];
    if(B[i]!=A[i]) b=false;
    d.insert(B[i]);
  }
  
  if(b){
    cout<<"Yes"<<endl;
    return 0;
  }
  if(k>n || c!=d){
    cout<<"No"<<endl;
    return 0;
  }
  if(k==n){
    reverse(ALL(B));
    b=true;
    rep(i,n){
      if(A[i]!=B[i]) b=false;
      if(b) cout<<"Yes"<<endl;
      else cout<<"No"<<endl;
      return 0;
    }
  }
  if(k<n-1){
    cout<<"Yes"<<endl;
    return 0;
  }
  
  vector<ll> AA(2*n);
  rep(i,n){
    AA[i]=A[i];
    AA[n+i]=A[i];
  }
  
  if(rolling_hush(B,AA)) cout<<"Yes"<<endl;
  else{
    reverse(ALL(B));
    if(rolling_hush(B,AA)) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
  }

  return 0;
}