N,K = map(int,input().split())
D = [int(i)-1 for i in input().split()]
cnt = 0
unionfind = [i for i in range(N)]
size = [1 for i in range(N)]
used = [False for i in range(N)]
def find(x):
	if unionfind[x] == x:
		return x
	unionfind[x] = find(unionfind[x])
	return unionfind[x]
def unite(x,y):
	x = find(x)
	y = find(y)
	if x == y:
		return
	if x < y:
		unionfind[y] = x
		size[x] += size[y]
	else:
		unionfind[x] = y
		size[y] += size[x]
for i in range(N):
	a = D[i]
	b = D[D[i]]
	unite(a,b)
for i in range(N):
	if not used[find(i)]:
		cnt += size[find(i)]-1
		used[find(i)] = True
def check():
	if K < cnt:
		return False
	return cnt % 2 == K % 2
if check():
	print('YES')
else:
	print('NO')