#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
using ll = long long int;

int main()
{
    ll N, K, cnt = 0;
    cin >> N >> K;
    vector<ll> vec(N, 0);

    for(int i = 0; i < N; i++)
    {
        cin >> vec[i];
    }

    bool isEnd = false;
    while(!isEnd)
    {
        bool loopSwap = false;
        for(int i = 0; i < N - 1; i++)
        {
            if(vec[i] > vec[i + 1])
            {
                swap(vec[i], vec[i + 1]);
                loopSwap = true;
                cnt++;
            }
        }
        
        if(!loopSwap)
            isEnd = true;
    }

    cout << ((K - cnt) % 2 == 0 ? "YES" : "NO") << endl;
}