#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  VI a(n), b(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  bool ans = false;
  if (k == n) {
    ans |= a == b;
    reverse(all(a));
    ans |= a == b;
  } else if (k > n) {
    ans |= a == b;
  } else if (k < n - 1) {
    sort(all(a));
    sort(all(b));
    ans |= a == b;
  } else {
    assert(k == n - 1);
    rep(_, 2) {
      VI c(3 * n + 1);
      rep(i, n) c[i] = a[i];
      c[n] = -1;
      rep(i, n) c[n + 1 + i] = c[2 * n + 1 + i] = b[i];
      VI z = z_algorithm(c);
      for(int i = n + 1; i < 3 * n + 1; i++) {
        if (z[i] == n) ans = true;
      }
      reverse(all(a));
    }
  }
  cout << (ans ? "Yes\n" : "No\n");
}