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

typedef long long ll;

int main() {
    ll n, k;
    cin >> n >> k;
    vector<int> d(n+1);
    vector<int> d2(n+1);
    for(int i=1;i<=n;i++) {
        int di;
        cin >> di;
        d[i] = di;
        d2[i] = di;
    }
    int l = 1, r = n;
    int cnt = 0;
    for(int i=1;i<=n;i++) {
        if(d[i] == i) {
            continue;
        } else {
            swap(d[i], d[d[i]]);
            cnt++;
            if(d[i]!=i)
                i--;
        }
    }

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