#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main()
{
  ll N, K;
  cin >> N >> K;
  ll D[N];
  FOR(i,0,N) cin >> D[i];
  FOR(i,0,N) --D[i];
  bool used[N];
  FOR(i,0,N) used[i] = false;
  int cnt = 0;
  FOR(i,0,N) {
    if(used[i]) continue;
    int j = i, k = 0;
    while(!used[j]) {
      used[j] = true;
      k++;
      j = D[j];
    }
    cnt += k - 1;
  }
  if(K<cnt) {
    puts("NO");
  } else if((K-cnt)%2==0) {
    puts("YES");
  } else {
    puts("NO");
  }
  return 0;
}