The array a with n integers is given. Let's call the sequence of one or more consecutive elements in a segment. Also let's call the segment k-good if it contains no more than k different values.

Find any longest k-good segment.

As the input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.

Input

The first line contains two integers n, k (1 ≤ k ≤ n ≤ 5·105) — the number of elements in a and the parameter k.

The second line contains n integers ai (0 ≤ ai ≤ 106) — the elements of the array a.

Output

Print two integers l, r (1 ≤ l ≤ r ≤ n) — the index of the left and the index of the right ends of some k-good longest segment. If there are several longest segments you can print any of them. The elements in a are numbered from 1 to n from left to right.

Examples

Input

5 5
1 2 3 4 5


Output

1 5


Input

9 3
6 5 1 2 3 2 1 4 5


Output

3 7


Input

3 1
1 2 3


Output

1 1
def main():
  a = [int(x) for x in input().split()]
  g = 1
  mo = 0
  w = 1
  bigarray = [0]* 1000000
  rmo = []
  req = a[1]
  seq = [int(x) for x in input().split()]
  bigarray[seq[0]] += 1
  first = 0
  last = 0
  if a[0] == req:
    rmo = [1, a[0]]
  else:
    while first != len(seq) - 1:
      if w < req:
        if bigarray[seq[first + 1]] == 0:
          first += 1
          bigarray[seq[first]] += 1
          g = g + 1
          w = w + 1
        elif bigarray[seq[first + 1]] != 0:
          bigarray[seq[first + 1]] += 1
          first = first + 1
          g = g + 1
        if mo < g:
          mo = g
          rmo = [last + 1, first + 1]
      elif w >= req:
        if bigarray[seq[first + 1]] == 0:
          bigarray[seq[last]] -= 1
          if bigarray[seq[last]] == 0:
            w = w - 1
          if g > mo:
            mo = g
            rmo = [last + 1, first + 1]
          g = g - 1
          last = last + 1
        else:
          g = g + 1
          first += 1
          bigarray[seq[first]] += 1
          if mo < g:
            mo = g
            rmo = [last + 1, first + 1]
  for x in rmo:
    print(x, end = ' ')
main() 