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 find_solution():

    n, k = list(map(int, input().split()))
    a = list(map(int, input().split()))
    # n, k  = [4,4]
    # a = [1,2,3,1, 4,5,6]
    dict_ = dict.fromkeys(a)



    if (len(set(a)) < k):
        print(-1,-1)
    elif k == 1:
        print(1,1)
    else:
        check_list = list(dict_.keys())[0:k]
        # l = a.index(check_list[0])
        r = a.index(check_list[-1])+1
        for l in range (0,r):
            # print(a[l:r])
            if len(set(a[l:r])) < k:
                break
        print(l,r)

# n, k  = [4,4]
# a = [1,2,3,1, 4,5,6]

find_solution()
