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 main():
    n,k = map(int,input().split())
    arr = list(map(int,input().split()))
    curr = {}
    indices = {}

    if k == 1:
        print(1,1)
        return

    min_l = -1
    min_r = -1
    l = 0
    
    for i in range(n):
        if arr[i] not in curr.keys():
            curr[arr[i]] = 1
        else:
            curr[arr[i]] += 1
        if len(curr) == k:
            r = i
            while len(curr) == k:
                curr[arr[l]] -= 1
                if curr[arr[l]] == 0:
                    curr.pop(arr[l])
                l += 1
            l -= 1
            min_l = l+1
            min_r = r+1
            break
            
    print(min_l,min_r)
            

main()
