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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.*;

public class E_LongestkGoodSegment {
    public static void main(String[] args) throws IOException {

        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        String input = bufferedReader.readLine();
        StringTokenizer stringTokenizer = new StringTokenizer(input, " ");

        int n = Integer.parseInt(stringTokenizer.nextToken());
        int k = Integer.parseInt(stringTokenizer.nextToken());
        input = bufferedReader.readLine();
        stringTokenizer = new StringTokenizer(input, " ");
        int[] numbers = new int[n];
        Map<Integer, Integer> numberSet = new HashMap<>();
        int startIndex = 0;
        int maxLength = 0;
        int maxStart = 0;
        int maxEnd = 0;

        for (int i = 0; i < n; i++) {
            numbers[i] = Integer.parseInt(stringTokenizer.nextToken());
            if (numberSet.containsKey(numbers[i])) {
                numberSet.put(numbers[i], numberSet.get(numbers[i]) + 1);

            } else {
                numberSet.put(numbers[i], 1);

            }
            if (numberSet.size() > k) {
                while (startIndex <= i) {
                    int freq = numberSet.get(numbers[startIndex]);

                    if (freq == 1) {
                        numberSet.remove(numbers[startIndex]);
                        startIndex++;
                        break;
                    } else {
                        numberSet.put(numbers[startIndex], freq - 1);
                        startIndex++;
                    }
                }
            }

            if (i - startIndex + 1 > maxLength) {
                maxLength = i - startIndex + 1;
                maxStart = startIndex;
                maxEnd = i;
            }


        }
        System.out.println((maxStart + 1) + " " + (maxEnd + 1));
    }
}
				   			  				   	     	   		