Problem: 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

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;
import java.util.Scanner;

/**
 * @auther chao
 * @date 15/12/30
 */
public class A {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pr = new PrintWriter(new OutputStreamWriter(System.out));

        String[] nums = br.readLine().split(" ");
        int n = Integer.parseInt(nums[0]);
        int k = Integer.parseInt(nums[1]);
        String[] s = br.readLine().split(" ");
        int[] a = new int[n];
        Map<Integer, Integer> map = new HashMap<>();
        int ans = 0;
        int l = 0, r = 0;
        int p = 0;
        for (int i = 0; i < n ;i++) {
            int x = Integer.parseInt(s[i]);
            a[i] = x;
            if (map.containsKey(x)) {
                map.put(x, map.get(x)+1);
            } else {
                map.put(x, 1);
                while (map.size() > k) {
                    int y = map.get(a[p++]);
                    if (y == 1) {
                        map.remove(a[p-1]);
                        break;
                    } else {
                        map.put(a[p-1], map.get(a[p-1]) - 1);
                    }
                }
            }
            if (i - p + 1 > ans) {
                ans = i - p + 1;
                l = p+1;
                r = i+1;
            }

        }
        pr.println(l + " " + r);

        br.close();
        pr.close();
    }
}