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>).
n, k = map(int, input().split())
g = list(map(int, input().split()))
cnj = set()
mapa = {}
ini = 0
a, b = 0, 3 * n
for i in range(n):
    if g[i] not in cnj:
        mapa[g[i]] = 1
        cnj.add(g[i])
        while len(cnj) > k or (len(cnj) == k and mapa[g[ini]] > 1):
            mapa[g[ini]] -= 1
            if mapa[g[ini]] == 0:
                cnj.remove(g[ini])
            ini += 1
    else:
        mapa[g[i]] += 1
        while len(cnj) > k or (len(cnj) == k and mapa[g[ini]] > 1):
            mapa[g[ini]] -= 1
            if mapa[g[ini]] == 0:
                cnj.remove(g[ini])
            ini += 1
    if len(cnj) >= k:
        if b - a > i - ini:
            b, a = i, ini
if b - a >= 2 * n:
    print("-1 -1")
else:
    print(a + 1, b + 1)# 1698318322.447567