You've got an array *a*, consisting of *n* integers: *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>. Your task is to find a minimal by inclusion segment [*l*, *r*] (1 ≤ *l* ≤ *r* ≤ *n*) such, that among numbers *a*<sub class="lower-index">*l*</sub>,  *a*<sub class="lower-index">*l* + 1</sub>,  ...,  *a*<sub class="lower-index">*r*</sub> there are exactly *k* distinct numbers.

Segment [*l*, *r*] (1 ≤ *l* ≤ *r* ≤ *n*; *l*, *r* are integers) of length *m* = *r* - *l* + 1, satisfying the given property, is called minimal by inclusion, if there is no segment [*x*, *y*] satisfying the property and less then *m* in length, such that 1 ≤ *l* ≤ *x* ≤ *y* ≤ *r* ≤ *n*. Note that the segment [*l*, *r*] doesn't have to be minimal in length among all segments, satisfying the given property.
The first line contains two space-separated integers: *n* and *k* (1 ≤ *n*, *k* ≤ 10<sup class="upper-index">5</sup>). The second line contains *n* space-separated integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> — elements of the array *a* (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>).
def array(n, k, a):
  if k == 1:
    print("1 1")
    return
  l = 0
  r = 0

  count_appear = {}
  for number in a:
    if number in count_appear:
      count_appear[number] += 1
    else:
      count_appear[number] = 1

  distinct_numbers = set()
  array_l_to_r = []
  while (l < count_appear[a[0]]):
    if (a[0] == a[l + 1]):
      l += 1
    else:
      break
  while (l < n and r < n):
    distinct_numbers.add(a[r])
    if (r >= l):
      array_l_to_r.append(a[r])
    r += 1

    if (len(distinct_numbers) == k):
      while (l < r):
        copy_array = [*array_l_to_r]
        copy_array.remove(a[l])
        if (a[l] in copy_array):
          array_l_to_r.remove(a[l])
          if (len(set(array_l_to_r)) == k):
            l += 1
          else:
            print(str(l + 1) + " " + str(r))
            return
        else:
          print(str(l + 1) + " " + str(r))
          return
            
  print("-1 -1")   

   
# Input
nk = list(map(int, input().split()))
n = nk[0] # the number of positive number
k = nk[1] # the number of distinct number
#  [x, y]
a = list(map(int, input().split())) # the positive numbers

# Run and get output
array(n, k, a)