#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll N,K;
ll cnt = 0;

void swap(ll *a, ll *b) {
    ll tmp = *a;
    *a = *b;
    *b = tmp;
}

int main(void) {
    cin >> N >> K;
    vector<ll> D(N+1);
    for (ll i=1; i<=N; i++) cin >> D[i];
    for (ll i=1; i<=N; i++) {
        while(D[i] != i) {
            swap(D[i], D[D[i]]);
            cnt++;
        }
        if (cnt > K) {
            cout << "NO" << endl;
            return 0;
        }
    }
    if ((K - cnt) % 2 == 0) cout << "YES" << endl;
    else cout << "NO" << endl;
    return 0;
}