#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = (a >= b ? a : b)
#define chmin(a, b) a = (a <= b ? a : b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)

long k;
int c, n, d[1 << 18], u[1 << 18];

void dfs(int v) {
    if (u[v]) { k -= c - 1; c = 0; } // ループして戻ってきたらそのグループの個数-1を引く
    else { u[v] = 1; c++; dfs(d[v]); }
}

int main() {
    cin >> n >> k;
    rep3(i, 1, n + 1) cin >> d[i];
    rep3(i, 1, n + 1) if(u[i] == 0) dfs(i);
    cout << (k < 0 || k % 2 ? "NO\n" : "YES\n");
}