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>).
class CodeforcesTask224BSolution:
    def __init__(self):
        self.result = ''
        self.n_k = []
        self.sequence = []

    def read_input(self):
        self.n_k = [int(x) for x in input().split(" ")]
        self.sequence = [int(x) for x in input().split(" ")]

    def process_task(self):
        cnt = [0 for x in range(100000)]
        for x in self.sequence:
            cnt[x - 1] += 1
        els = sum([1 if x else 0 for x in cnt])
        l = 0
        r = self.n_k[0] - 1
        if els < self.n_k[1]:
            self.result = "-1 -1"
        else:
            while els >= self.n_k[1]:
                cnt[self.sequence[r] - 1] -= 1
                if not cnt[self.sequence[r] - 1]:
                    els -= 1
                r -= 1
            r += 1
            els += 1
            while els == self.n_k[1]:
                cnt[self.sequence[l] - 1] -= 1
                if not cnt[self.sequence[l] - 1]:
                    els -= 1
                l += 1
            if l:
                l -= 1
            self.result = "{0} {1}".format(l + 1, r + 1)

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask224BSolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
