#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int64_t n, k;
    cin >> n >> k;

    vector<int> d(n);
    vector<int> e(n);
    for (int i = 0; i < n; i++) {
        cin >> d[i];
        d[i]--;
        e[d[i]] = i;
    }

    for (int i = 0; i < n; i++) {
        if (d[i] != i) {
            k--;
            int j = e[i];
            swap(e[i], e[d[i]]);
            swap(d[i], d[j]);
        }
    }
    if (k < 0) {
        cout << "NO" << endl;
    } else if (k % 2 == 0) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }
}