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>).
from collections import defaultdict


class Counter:
    def __init__(self):
        self.d = {}
        self.c = 0

    def add(self, item):
        if item in self.d:
            self.d[item] += 1
        else:
            self.d[item] = 1
        if self.d[item] == 1:
            self.c += 1

    def remove(self, item):
        self.d[item] -= 1
        if self.d[item] == 0:
            self.c -= 1


[n, k] = [int(item) for item in input().split(' ')]
arr = [int(item) for item in input().split(' ')]

l = 0
min_len = n + 1
c = Counter()
minimizer = (-1, -1)

for r in range(n):
    c.add(arr[r])

    while c.c >= k:

        print("minimizing", arr[l:r + 1], c.c)
        m = r - l + 1
        if m < min_len:
            min_len = m
            minimizer = (l, r)
        c.remove(arr[l])
        l += 1
print(minimizer[0] + 1, minimizer[1] + 1)
