#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long int

signed main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, K;
	cin >> N >> K;
	int d[N + 1];
	d[0] = -1;
	int cnt1 = 0;
	int cnt2 = 0;
	REP(i, 1, N) {
		cin >> d[i];
	}
	REP(i, 1, N) {
		// cout << d[i] << " " << d[d[i]] << endl;
		if (d[d[i]] == i && i != d[i]) cnt1++;
		else if (i != d[i]) cnt2++;
	}
	cnt1 /= 2;
	cnt2 = max(0LL, cnt2 - 1LL);
	// cout << cnt1 / 2 << " " << cnt2 << endl;
	if (N == 2) {
		if (K - cnt1 % 2 == 0) cout << "YES" << endl;
		else if (N == 2 && K - cnt1 % 2) cout << "NO" << endl;
	}
	else if (cnt1 + cnt2 == K) cout << "YES" << endl;
	else if (cnt1 + cnt2 < K - 1LL) cout << "YES" << endl;
	else cout << "NO" << endl;




    return 0;
}