#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a*b/gcd(a,b);
}


signed main(void) {
    int n,k;
    cin >> n >> k;
    vi d(n);
    rep(i,n)cin >> d[i],d[i]--;
    int ans = 0;
    vi used(n);
    rep(i,n)if(used[i] == 0){
        int t = d[i];
        int cnt = 0;
        while(1){
            used[t]++;
            //cout << " " << t << " " << d[t] << endl;
            t = d[t];
            if(used[t])break;
            cnt++;
        }
        //cout << i << " " << cnt << endl;
        ans += cnt;
    }
    if(ans <= k && (k - ans)%2 == 0){
        cout << "YES" << endl;
    }else{
        cout << "NO" << endl;
    }
}