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 = list(map(int, input().split()))
  A = list(map(int, input().split()))
  
  used = set()
  history = []
  
  cur = 0
  used.add(0)
  
  while True:
      history.append(cur)
      next_cur = A[cur] - 1
      if next_cur in used:
          loop_start = history.index(next_cur)
          break
      used.add(next_cur)
      cur = next_cur
  
  B = history[loop_start:]
  if K <= loop_start:
      result = history[K]
  else:
      result = B[(K - loop_start) % len(B)]
  
  print(result + 1)
  
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"}]