/* -*- coding: utf-8 -*-
 *
 * 482.cc: No.482 あなたの名は - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

int ds[MAX_N], es[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  ll k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    scanf("%d", &ds[i]);
    ds[i]--;
    es[ds[i]] = i;
  }

  int c = 0;
  for (int i = 0; i < n; i++) {
    int j = es[i];
    if (i != j) {
      swap(ds[i], ds[j]);
      swap(es[i], es[j]);
      c++;
    }
  }
  //for (int i = 0; i < n; i++) printf("%d ", ds[i]); putchar('\n');
  //for (int i = 0; i < n; i++) printf("%d ", es[i]); putchar('\n');
  //printf("c=%d\n", c);

  if (k >= c && ((k - c) & 1LL) == 0LL) puts("YES");
  else puts("NO");
  return 0;
}