#include <iostream>
#include <vector>

using namespace std;

int main() {
	int n;
	long long K;
	cin >> n >> K;

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

	int ans = 0;
	for (int i = 0; i < n; i++) {
		if (D[i] != i) {
			int j = pos[i];
			swap(D[i], D[j]);
			pos[D[i]] = i;
			pos[D[j]] = j;
			ans++;
		}
	}

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