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 root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


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

bool solve() {
  if (A == B) {
    return true;
  }
  if (K == 1) {
    return false;
  } else if (K == N) {
    auto revA = A.dup.reverse;
    if (revA == B) return true;
    return false;
  } else if (K > N) {
    return false;
  } else {
    alias Entry = Tuple!(int, "val", int, "pos");
    auto as = new Entry[N];
    auto bs = new Entry[N];
    foreach (i; 0 .. N) as[i] = Entry(A[i], i);
    foreach (i; 0 .. N) bs[i] = Entry(B[i], i);
    as.sort;
    bs.sort;
    auto ps = new int[N];
    foreach (i; 0 .. N) {
      if (as[i].val != bs[i].val) {
        return false;
      }
      ps[as[i].pos] = bs[i].pos;
    }
    if (N % 2 == 0) {
      return true;
    }
    foreach (i; 0 .. N - 1) {
      if (as[i].val == as[i + 1].val) {
        return true;
      }
    }
    auto uf = new int[N];
    uf[] = -1;
    foreach (i; 0 .. N) {
      uf.connect(i, ps[i]);
    }
    int numComps;
    foreach (i; 0 .. N) if (uf[i] < 0) {
      ++numComps;
    }
    if ((N - numComps) % 2 == 0) {
      return true;
    }
    return false;
  }
}

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) {
  }
}