Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Longest k-Good Segment

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe array *a* with *n* integers is given. Let's call the sequence of one or more consecutive elements in *a* segment. Also let's call the segment k-good if it contains no more than *k* different values.

Find any longest k-good segment.

As the input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.

Input

The first line contains two integers *n*, *k* (1 ≤ *k* ≤ *n* ≤ 5·10^{5}) — the number of elements in *a* and the parameter *k*.

The second line contains *n* integers *a*_{i} (0 ≤ *a*_{i} ≤ 10^{6}) — the elements of the array *a*.

Output

Print two integers *l*, *r* (1 ≤ *l* ≤ *r* ≤ *n*) — the index of the left and the index of the right ends of some k-good longest segment. If there are several longest segments you can print any of them. The elements in *a* are numbered from 1 to *n* from left to right.

Examples

Input

5 5

1 2 3 4 5

Output

1 5

Input

9 3

6 5 1 2 3 2 1 4 5

Output

3 7

Input

3 1

1 2 3

Output

1 1

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/23/2017 04:16:41 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|