#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct UnionFind {
	vector<int> par;
	int cnt;
	UnionFind(int size_) : par(size_, -1), cnt(size_) {}
	void unite(int x, int y) {
		if((x = find(x)) != (y = find(y))) {
			if(par[y] < par[x]) swap(x, y);
			par[x] += par[y]; par[y] = x; cnt--;
		}
	}
	bool same(int x, int y) { return find(x) == find(y); }
	int find(int x) { return par[x] < 0 ? x : par[x] = find(par[x]); }
	int size(int x) { return -par[find(x)]; }
	int size() { return cnt; }
};

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	ll N, K;
	cin >> N >> K;

	UnionFind uf(N);
	ll sum = 0;
	for(int i = 0; i < N; i++) {
		int d;
		cin >> d;
		d--;
		if(i != d) {
			uf.unite(i, d);
		}
	}

	bool f = false;
	for(int i = 0; i < N; i++) {
		if(uf.find(i) == i) {
			sum += uf.size(i) - 1;
			if(uf.size(i) >= 4) f = true;
		}
	}

	if(sum == 0) {
		if(K % 2 == 0) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}
	else if(!f) {
		if(sum <= K && K % 2 == sum % 2) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}
	else {
		if(sum <= K && f) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}


}