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>).
l = input().split(" ")
n = int(l[0])
k = int(l[1])
myList = input().split(" ")
for i in range (n):
    myList[i] = int(myList[i])
def solve(n,k,myList):
    count = [0]*(100000+1)
    dem = 0
    for i in range(n):
        if count[myList[i]] == 0:
            count[myList[i]] += 1
            dem += 1
        else:
            count[myList[i]] += 1
        if dem == k:
            j = 0
            while (True):
                if (count[myList[j]] > 1):
                    count[myList[j]] -= 1
                    j += 1
                else:
                    print(j+1,i+1)
                    exit()
    if (dem != k):
        print(-1,-1)

solve(n,k, myList)
