import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int[] suffixZ(T)(const(T[]) as) {
  import std.algorithm : max;
  const n = cast(int)(as.length);
  if (n == 0) return [];
  auto zs = new int[n];
  int j;
  foreach (i; 1 .. n) {
    if (i + zs[i - j] < j + zs[j]) {
      zs[i] = zs[i - j];
    } else {
      int z = max(j + zs[j] - i, 0);
      for (; i + z < n && as[z] == as[i + z]; ++z) {}
      zs[i] = z;
      j = i;
    }
  }
  zs[0] = n;
  return zs;
}


int N, K;
int[] A, B;

bool solve() {
  if (A == B) {
    return true;
  }
  if (K > N) {
    return false;
  } else if (K == N) {
    auto as = A.dup;
    as.reverse;
    if (as == B) return true;
    return false;
  } else if (K == N - 1) {
    auto as = A.dup;
    foreach (dir; 0 .. 2) {
      // cyclic shift?
      const zs = suffixZ(as ~ B ~ B);
      foreach (i; N .. N + N) {
        if (zs[i] >= N) {
          return true;
        }
      }
      as.reverse;
    }
    return false;
  } else {
    auto as = A.dup;
    auto bs = B.dup;
    as.sort;
    bs.sort;
    return (as == bs);
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      K = readInt;
      A = new int[N]; foreach (i; 0 .. N) A[i] = readInt;
      B = new int[N]; foreach (i; 0 .. N) B[i] = readInt;
      
      const ans = solve;
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}