N, K = map(int, input().split())
D = list(map(int, input().split()))

visited = [False] * (N + 1)  # 1-based indexing
s_min = 0

for i in range(1, N + 1):
    if not visited[i]:
        cycle_length = 0
        current = i
        while not visited[current]:
            visited[current] = True
            current = D[current - 1]  # D is 0-based list for 1-based elements
            cycle_length += 1
        s_min += (cycle_length - 1)

# Check the conditions
if K >= s_min and (K - s_min) % 2 == 0:
    print("YES")
else:
    print("NO")