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>).
import sys

# https://codeforcesladders.firebaseapp.com/?handle=lanadeus

# makefile
"""
run: code.py
	python code.py < in.txt
run-lc: lc.py
	python lc.py < in.txt
run-test: test.py
	python test.py < in.txt
"""

def readline():
    return sys.stdin.readline().strip()


def read(t=int):
    s = sys.stdin.readline()
    return list(map(t, s.strip().split(' ')))


def readint():
    return read()[0]

mod = 10**9 + 7
def go():
    n, k = read()
    alist = read()
    s = set()
    for i,a in enumerate(alist):
        s.add(a)
        if len(s) == k:
            print(1,i+1)
            return
    print(-1,-1)
go()
