#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/dsu>
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n,k;
    cin>>n>>k;
    vector<ll> d(n);
    for(int i = 0;i<n;i++) cin>>d[i];
    atcoder::dsu uf(n);
    for(int i = 0;i<n;i++) {
        d[i]--;
        uf.merge(i,d[i]);
    }
    ll need = 0;
    for(auto now:uf.groups()){
        need += now.size() - 1;
    }
    if(need<=k&&need%2==k%2){
        cout<<"YES\n";
    }else{
        cout<<"NO\n";
    }
}