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 checkF(a, b):
    l = a[0]
    max = 100
    maxi = -1
    maxk = -1
    for k in range(l):
        res = 0
        s = set()
        for i in range(k,l):
            if (b[i] not in s):
                s.add(b[i])
                res += 1
                if res == a[1] and i - k <= a[1]:
                    if i - k <max:
                        max = i - k
                        maxi = i+1
                        maxk = k+1
                        if max == a[1]-1:return print(str(k+1)+" "+str(i+1))
                    break
            if (i==l-a[1]+2): break
    return print(str(maxk)+" "+str(maxi))

a = list(map(int, input().split()))
b = list(map(int, input().split()))
checkF(a, b)
