#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MAXN = ( int ) 2e5;

int D[ MAXN ];
int vis[ MAXN ];

signed main(){
  int N; ll K; cin >> N >> K;
  for( int i = 0; i < N; ++i ){
    cin >> D[ i ];
    --D[ i ];
  }
  int minswap = 0;
  for( int i = 0; i < N; ++i ){
    if( vis[ i ] or i == D[ i ] ) continue;
    for( int u = D[ i ]; u != i; u = D[ u ] ){
      ++minswap;
      vis[ u ] = 1;
    }
  }
  if( minswap > K ){
    cout << "NO" << endl;
  } else{
    if( K - minswap & 1LL ){
      cout << "NO" << endl;
    } else{ 
      cout << "YES" << endl;
    }
  }
  return 0;
}