#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

ll N, K;
int D[200100];
bool used[200100];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N >> K;

    for(int i=1;i<=N;++i){
        std::cin >> D[i];
    }

    ll mn = 0;
    for(int i=1;i<=N;++i){
        if(used[i]){continue;}

        int x = i, t = 0;
        while(!used[x]){
            used[x] = true;
            ++t;
            x = D[x];
        }

        mn += t - 1;
    }

    const string YESNO[2] = {"NO", "YES"};
    std::cout << YESNO[mn <= K && (K - mn) % 2 == 0] << std::endl;
}