#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)

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n; ll k;
    cin >> n >> k;
    int d[n];
    rep(i, n) cin >> d[i];
    map<int, int> mp;
    int c = 0;
    rep(i, n) {
        if (mp[i + 1] == 0 && mp[d[i]] == 0) {
            mp[i + 1] = ++c;
            mp[d[i]] = c;
        } else {
            if (mp[i + 1]) {
                mp[d[i]] = mp[i + 1];
            } else {
                mp[i + 1] = mp[d[i]];
            }
        }
    }
    int a[200001] = {0};
    for (auto e : mp) {
        a[e.S]++;
    }
    int ans = 0;
    rep(i, 200001) {
        if (a[i] < 2) continue;
        ans += a[i] - 1;
    }
    if (ans <= k && ans % 2 == k % 2) out("YES");
    else out("NO");
}