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())
  button = list(map(int, input().split()))
  visit = [-1] * n
  hisitory = []
  push = 0
  f = 0
  for i in range(k):
      visit[push] = i
      hisitory.append(push)
      push = button[push] - 1
      if visit[push] != -1:
          f = 1
          start = visit[push]
          last = push
          end = i
          break
  if f == 0:
      print(hisitory[-1] + 1)
  else:
      loop = end - start + 1
      geta = start - 1
      kmod = (k - start + 1) % loop
      if kmod == 0:
          kmod = loop
      print(hisitory[geta + kmod] + 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"}]