#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int n;
    ll k;
    cin >> n >> k;
    VI a(n), b(n);
    REP(i,n) cin >> a[i], a[i]--, b[a[i]] = i;
    REP(i,n){
        if (a[i] == i) continue;
        int j = b[i];
        swap(b[i], b[a[i]]);
        swap(a[i], a[j]);
        k--;
    }
    cout << (k >= 0 && k % 2 == 0 ? "YES" : "NO") << endl;
    return 0;
}