#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 200010


int main(){
  int n,d[SIZE],dic[SIZE];
  ll k;
  int sum = 0;
  
  scanf("%d%lld",&n,&k);

  for(int i=0;i<n;i++){
    scanf("%d",d+i);
    d[i]--;
    dic[d[i]] = i;
  }

  for(int i=0;i<n;i++){
    if(d[i] != i){
      dic[d[i]] = dic[i];      
      swap(d[i],d[dic[i]]);
      sum++;
    }
    /*
    for(int j=0;j<3;j++){
      cerr << j << " : " << dic[j] << endl;
    }
    */
  }

  debug(sum);
  
  if(sum <= k && (k-sum)%2==0){
    puts("YES");
  }else{
    puts("NO");
  }
  
  return 0;
}