#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

#define MAX_N 200000

int uf_par[MAX_N];
int uf_rank[MAX_N];

void uf_init( int n ) {
    for ( int i = 0; i < n; i++ ) {
        uf_par[i] = i;
        uf_rank[i] = 0;
    }
}

int uf_find( int x ) {
    if ( uf_par[x] == x ) { return x; }
    else { return uf_par[x] = uf_find(uf_par[x]); }
}

void uf_unite( int x, int y ) {
    x = uf_find( x );
    y = uf_find( y );
    if ( x == y ) { return; }
    
    if ( uf_rank[x] < uf_rank[y] ) {
        uf_par[x] = y;
    }
    else {
        uf_par[y] = x;
        if ( uf_rank[x] == uf_rank[y] ) { uf_rank[x]++; }
    }
    
}

bool uf_same( int x, int y ) {
    return uf_find(x) == uf_find(y);
}

int main() {
    
    int N;
    long long K;
    cin >> N >> K;
    
    uf_init(N);
    
    for ( int i = 0; i < N; i++ ) {
        int a;
        cin >> a;
        a--;
        uf_unite( i, a );
    }
    
    vector<int> A(N,0);
    for ( int i = 0; i < N; i++ ) {
        A[uf_find(i)]++;
    }
    int x = 0;
    for ( int i = 0; i < N; i++ ) {
        if ( A[i] ) { x += A[i]-1; }
    }
    
    
    if ( K < x ) { cout << "NO" << endl; }
    else {
        cout << ( (K - x)%2 ? "NO" : "YES" ) << endl;
    }
    
    return 0;
}