#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
using namespace std;
typedef pair<int, int> P;

int cnt = 0;
int a[200010];

struct UF{
    vector<int> par;
    vector<int> sz;
    UF(){}
    UF(int n){
        par.resize(n);
        sz.resize(n, 1);
        rep(i, 0, n) par[i] = i;
    }
    int find(int x){
        if(x == par[x]) return x;
        return par[x] = find(par[x]);
    }
    void unite(int x, int y){
        x = find(x); y = find(y);
        if(x == y) return;
        if(sz[x] < sz[y]) swap(x, y);
        sz[x] += sz[y];
        par[y] = x;
    }
    bool same(int x, int y){
        return find(x) == find(y);
    }
    int size(int x){
        return sz[find(x)];
    }
};

signed main(){
    int n, k;
    cin >> n >> k;
    UF uf(n);
    rep(i, 0, n){
        cin >> a[i];
        a[i]--;
    }
    rep(i, 0, n){
        if(a[i] == i) continue;
        uf.unite(i, a[i]);
    }
    int cnt = 0;
    rep(i, 0, n){
        if(uf.find(i) != i) continue;
        cnt += uf.size(i) - 1;
    }
    bool f = true;
    if(cnt > k) f = false;
    else if((k - cnt) % 2 == 1) f = false;
    cout << (f ? "YES" : "NO") << endl;
}