import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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; }
real readReal() { return readToken.to!real; }

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(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N;
long K;
int[] D;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      K = readLong();
      D = new int[N];
      foreach (i; 0 .. N) {
        D[i] = readInt() - 1;
      }
      auto vis = new bool[N];
      int sum;
      foreach (i; 0 .. N) {
        if (!vis[i]) {
          int len;
          for (int j = i; !vis[j]; j = D[j]) {
            ++len;
            vis[j] = true;
          }
          sum += (len - 1);
        }
      }
      const ans = (K >= sum && (K - sum) % 2 == 0);
      writeln(ans ? "YES" : "NO");
    }
  } catch (EOFException e) {
  }
}