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 sys import stdin


def main():
    n, k = map(int, stdin.readline().split())
    ar = list(map(int, stdin.readline().split()))
    d = 0
    count = [0] * (10 ** 5 + 1)
    start = 0
    end = 0
    ml = n + 1
    ms = -1
    me = -1
    while end < n:
        while end < n and d < k:
            count[ar[end]] += 1
            if count[ar[end]] == 1:
                d += 1
            end += 1
        while d == k:
            if end - start < ml:
                ml = end - start
                ms = start + 1
                me = end
            count[ar[start]] -= 1
            if count[ar[start]] == 0:
                d -= 1
            start += 1
    print(ms, me)


if __name__ == "__main__":
    main()
