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>).
arr=list(map(int,input().split()))
n,k=arr
inp=list(map(int,input().split()))
from collections import Counter
c=Counter([])
start=0
for i in range(len(inp)):
    c[inp[i]]+=1
    if len(c.keys())==k:
        break
if len(c.keys())<k:
    print ('1 -1')
else:
    end=i
    mini=end-start+1
    a=(start,end)
    while 1:
        while c[inp[start]]>1:
            c[inp[start]]-=1
            start+=1
            if end-start+1<mini:
                mini=end-start+1
                a=(start,end)
        c[inp[start]]-=1
        while end<len(inp):
            if c[inp[end]]==0:
                c[inp[end]]+=1
                break
            else:
                end+=1
        if end<len(inp):
            if end-start+1<mini:
                mini=end-start+1
                a=(start,end)
        else:
            break
    print (a[0]+1,end=" ")
    print (a[1]+1)