#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
using namespace std;


int main(){

  long long int n, k;
  cin >> n >> k;

  vector<long long int> d(n);
  for(int i=0; i<n; i++) cin >> d[i];

  long long int tmp = 0;
  for(long long int i=0; i<n; i++){
    if( d[i] != i+1 ){
      swap( d[i], d[ d[i]-1 ] );
      tmp++;
      i--;
    }
  }

  for(long long int i=0; i<n; i++) cerr << d[i] << " ";
  cerr << endl;
  cerr << tmp << endl;

  k -= tmp;

  if( k % 2 == 0 && k >= 0 ) cout << "YES" << endl;
  else cout << "NO" << endl;


  return 0;
}