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()))
  way = A[0]
  List = [0 for n in range(N)]
  List[way - 1] += 1
  count = 0
  string = f"{way}"
  # print(f"string:{string}")
  # print(f"way:{way}")
  
  for i in range(10**7):
      way = A[way - 1]
      List[way - 1] += 1
      count += 1
      # print(f"way:{way}")
      # print(f"count:{count}")
      # print(List)
      if max(List) == 3:
          break
      else:
          string += f"{way}"
          # print(f"string:{string}")
          # print()
  
  # print(List)
  # print()
  new_list = [i for i in List if i == 1]
  length = len(new_list)
  n_list = [j for j in List if j >= 2]
  # print(new_list)
  # print(n_list)
  amari = (K - length) % len(n_list)
  
  print(int(n_list[amari + 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"}]