description: You are given a permutation p of n elements. A permutation of n elements is an array of length n containing each integer from 1 to n exactly once. For example, [1, 2, 3] and [4, 3, 5, 1, 2] are permutations, but [1, 2, 4] and [4, 3, 2, 1, 2] are not permutations. You should perform q queries.
  
  There are two types of queries:
  
    * 1 x y — swap p_x and p_y. 
    * 2 i k — print the number that i will become if we assign i = p_i k times. 
  
  Input
  
  The first line contains two integers n and q (1 ≤ n, q ≤ 10^5).
  
  The second line contains n integers p_1, p_2, ..., p_n.
  
  Each of the next q lines contains three integers. The first integer is t (1 ≤ t ≤ 2) — type of query. If t = 1, then the next two integers are x and y (1 ≤ x, y ≤ n; x ≠ y) — first-type query. If t = 2, then the next two integers are i and k (1 ≤ i, k ≤ n) — second-type query.
  
  It is guaranteed that there is at least one second-type query.
  
  Output
  
  For every second-type query, print one integer in a new line — answer to this query.
  
  Examples
  
  Input
  
  
  5 4
  5 3 4 2 1
  2 3 1
  2 1 2
  1 1 3
  2 1 2
  
  
  Output
  
  
  4
  1
  2
  
  
  Input
  
  
  5 9
  2 3 5 1 4
  2 3 5
  2 5 5
  2 5 1
  2 5 3
  2 5 4
  1 5 4
  2 5 3
  2 2 5
  2 5 1
  
  
  Output
  
  
  3
  5
  4
  2
  3
  3
  3
  1
  
  Note
  
  In the first example p = \{5, 3, 4, 2, 1\}. 
  
  The first query is to print p_3. The answer is 4.
  
  The second query is to print p_{p_1}. The answer is 1.
  
  The third query is to swap p_1 and p_3. Now p = \{4, 3, 5, 2, 1\}.
  
  The fourth query is to print p_{p_1}. The answer is 2.
solution: import sys
  raw_input = iter(sys.stdin.read().splitlines()).next
  
  def solution():
      n, q = map(int, raw_input().strip().split())
      block = int(n**0.5)
      p = map(lambda x: int(x)-1, raw_input().strip().split())
      r = [0]*n
      for i in xrange(n):
          r[p[i]] = i
      a = [0]*n
      for x in xrange(n):
          ax = x
          for _ in xrange(block):
              ax = p[ax]
          a[x] = ax
      result = []
      for _ in xrange(q):
          op, x, y = map(int, raw_input().strip().split())
          x -= 1
          if op == 1:
              y -= 1
              r[p[x]], r[p[y]] = r[p[y]], r[p[x]]
              p[x], p[y] = p[y], p[x]
              for x in (x, y):
                  ax = x
                  for _ in xrange(block):
                      ax = p[ax]
                  for _ in xrange(block):
                      a[x] = ax
                      x, ax = r[x], r[ax]
          else:
              while y >= block:
                  y -= block
                  x = a[x]
              for _ in xrange(y):
                  x = p[x]
              result.append(x+1)
  
      return "\n".join(map(str, result))
  
  print '%s' % solution()