#include <bits/stdc++.h>

using namespace std;

#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})

const int inf = 1LL << 55;
const int mod = 1e9 + 7;

struct UnionFind {
  vector<int> data;
  UnionFind(){}
  UnionFind(int n):data(n, -1){}
  int find(int x){ return (data[x] < 0 ? x : data[x] = find(data[x])); }
  int size(int x){ return -data[find(x)]; }
  bool same(int x, int y) { return find(x) == find(y); }
  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if(x == y) return false;
    if(data[x] < data[y]) swap(x, y);
    data[x] += data[y], data[y] = x;
    return true;
  }
};

#define MAX_N 200000
int N, K;
int D[MAX_N];
UnionFind uf;

signed main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  cin >> N >> K;
  uf = UnionFind(N);
  rep(i, N) cin >> D[i], uf.unite(i, --D[i]);

  int sum = 0;
  rep(i, N) if(i == uf.find(i)) sum += uf.size(i)-1;

  if(sum > K) puts("NO");
  else if((K - sum) % 2) puts("NO");
  else puts("YES");

  return 0;
}