The 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·105) — the number of elements in a and the parameter k.

The second line contains n integers ai (0 ≤ ai ≤ 106) — 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
import java.util.*;

public class longestGoodSegment {
    public static void main (String[]args) {
        Scanner scan = new Scanner (System.in);

        int length = scan.nextInt();
        int maxDiffNums = scan.nextInt();

        int [] arr = new int [length];

        for (int i = 0; i < length; i++) {
            arr[i] = scan.nextInt();
        }

        int firstPointer = 0;
        int secondPointer = 0;
        int greatestLength = 0;

        int bestFirst = 0;
        int bestSecond = 0;

        Hashtable <Integer, Integer> currentValues = new Hashtable <Integer, Integer>();

        while (firstPointer < length) {
            if (currentValues.containsKey(arr[firstPointer])) {
                int cur = currentValues.get(arr[firstPointer]);
                currentValues.put(arr[firstPointer], cur + 1);
            }
            else {
                currentValues.put(arr[firstPointer], 1);
            }

            if (currentValues.size() == maxDiffNums + 1) {
                while (true) {
                    if (currentValues.get(arr[secondPointer]) == 1) {
                        currentValues.remove(arr[secondPointer]);
                        secondPointer++;
                        break;
                    }
                    else {
                        int cur = currentValues.get(arr[secondPointer]);
                        cur--;
                        currentValues.put(arr[secondPointer], cur);
                        secondPointer++;
                    }
                }
            }

            if ((firstPointer - secondPointer + 1) > greatestLength) {
                bestFirst = secondPointer;
                bestSecond = firstPointer;

                greatestLength = firstPointer - secondPointer + 1;
            }

            firstPointer++;
        }

        System.out.println((bestFirst + 1) + " " + (bestSecond + 1));
    }
}
