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.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/**
 *
 * @author ADNAN
 */
public class LongestkGoodSegment {

    public static void main(String args[]) throws Exception {

        int n, k;
        int a[];
        Map<Integer, Integer> f = new HashMap();

        InputStreamReader ir = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(ir);
        String line;
        String arr[];

        line = br.readLine();
        arr = line.split(" ");

        n = Integer.parseInt(arr[0]);
        k = Integer.parseInt(arr[1]);
        a = new int[n];

        line = br.readLine();
        arr = line.split(" ");

        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(arr[i]);
        }

        int l = 0, r = 0;
        int i = 0;
        int j = 0;
        int diff = 0;
        int res = 0;
        int max = 0;
        for (; i < n;) {

            while (j < n && diff <= k) {
                if (!f.containsKey(a[j])) {
                    diff++;
                    if (diff > k) {
                        diff--;
                        break;
                    }
                    f.put(a[j], 1);
                } else {
                    f.replace(a[j], f.get(a[j]) + 1);
                }
                max++;
                j++;
            }

            if (max > res) {
                res = max;
                l = i + 1;
                r = j;
            }
            if (f.get(a[i]) == 1) {
                f.remove(a[i]);
                diff--;
            } else {
                f.replace(a[i], f.get(a[i]) - 1);
            }
            max--;
            i++;
            if (j >= n) {
                break;
            }
        }
        System.out.println(l + " " + r);

    }
}
