output_description: Print the integer representing the town the king will be in if he starts at
  Town 1 and uses a teleporter exactly K times from there.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      A_1 A_2 \dots A_N
attempt: n, k = [int(i) for i in input().split()]
  A = [0] + [int(i) for i in input().split()]
  # first study the cycle of A
  cycle = [A[1]]
  i = A[1]
  visited = set(cycle)
  while A[i] not in visited:
      cycle.append(A[i])
      visited.add(A[i])
      i = A[i]
  interest_ind = cycle.index(A[i])
  second_part = cycle[interest_ind:]
  p = len(cycle) - interest_ind
  k -= 1
  if k < interest_ind:
      print(cycle[k])
  else:
      k -= interest_ind
      k %= p
      print(cycle[interest_ind + k])
  
problem_description: Statement
  
  The Kingdom of Takahashi has N towns, numbered 1 through N.
  
  There is one teleporter in each town. The teleporter in Town i (1 \leq i \leq
  N) sends you to Town A_i.
  
  Takahashi, the king, loves the positive integer K. The selfish king wonders
  what town he will be in if he starts at Town 1 and uses a teleporter exactly K
  times from there.
  
  Help the king by writing a program that answers this question.
samples: [{"input": "4 5\n    3 2 4 1", "output": "4\n    \n\nIf we start at Town 1 and use the teleporter 5 times, our travel will be as\nfollows: 1 \\to 3 \\to 4 \\to 1 \\to 3 \\to 4.\n\n* * *"}, {"input": "6 727202214173249351\n    6 5 2 5 3 2", "output": "2"}]