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 = map(int, input().split())
  A = list(map(int, input().split()))
  
  mati_check_set = {0}
  mati_order = [0]
  count = 0
  mati = 0
  check1, check2 = True, True
  while check1 and check2:
      next_town = A[mati] - 1
      count += 1
      if next_town not in mati_check_set:
          mati_check_set.add(next_town)
          mati_order.append(next_town)
          mati = next_town
      else:
          loop = (next_town, mati)
          mati_order.append(next_town)
          check1 = False
          break
  
      if count - 1 == K:
          check2 = False
          ans = next_town + 1
          print(ans)
  
  if check1 == False:
      count1 = 0
      check3 = True
      town = 0
      if loop[0] != 0:
          while check3:
              next_town = A[town] - 1
              count1 += 1
              if next_town == loop[0]:
                  check3 = False
              town = next_town
          a = count1
          b = len(mati_order) - 2
          c = b - a + 1
          amari = (K - a + 1) % (c + 1)
          index = mati_order.index(loop[0]) + amari
          print(mati_order[index])
      else:
          c = len(mati_order) - 1
          index = K % c
          print(mati_order[index] + 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"}]