#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    ll n, k;
    cin >> n >> k;
    int a[n];
    rep(i,n){
        cin >> a[i];
        a[i]--;
    }

    int f[n] = {};
    rep(i,n){
        if(f[i] == 1) continue;
        int cnt = 1;
        f[i] = 1;
        int now = a[i];
        while(f[now] == 0){
            f[now] = 1;
            cnt++;
            now = a[now];
        }
        k -= cnt - 1;
    }

    if(k >= 0 && k % 2 == 0)yn;
    return 0;
}