#include<iostream>
using namespace std;
long k;int c,n,d[1<<18],u[1<<18];
void dfs(int v)
{
	if(u[v])k-=c-1;
	else u[v]=1,c++,dfs(d[v]);
}
main()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++)cin>>d[i];
	for(int i=1;i<=n;i++)if(!u[i])c=0,dfs(i);
	cout<<(k<0||k%2?"NO\n":"YES\n");
}