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.*;
import java.util.*;
public class kgood {
    public static void main (String[] args) throws IOException {
        // read in data
        BufferedReader input = new BufferedReader (new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(input.readLine());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        int[] arr = new int[n];
        st = new StringTokenizer(input.readLine());
        for (int i=0;i<n;i++) arr[i] = Integer.parseInt(st.nextToken());
        // count number of subarrays
        int bestLeft = 0;
        int bestRight = 0;
        int left = 0;
        int right = 0;
        TreeMap<Integer, Integer> window = new TreeMap<>();
        while (right < n) {
            add(arr[right], window);
            // System.out.println("next");
            // System.out.println(window);
            // System.out.println(left + " " + right);
            // System.out.println(bestLeft + " " + bestRight);
            while (window.size() > k) {
                // System.out.println(window);
                // System.out.println(left);
                remove(arr[left], window);
                left += 1; }
            if (right-left+1 > bestRight-bestLeft+1) {
                bestRight = right;
                bestLeft = left;
            }
            // System.out.println(window);
            // System.out.println(left + " " + right);
            // System.out.println(bestLeft + " " + bestRight);
            right += 1;
        }
        // write result
        PrintWriter out = new PrintWriter(System.out);
        out.println((bestLeft+1) + " " + (bestRight+1));
        out.close();
    }
    static void add(int x, TreeMap<Integer, Integer> y) {
        if (y.containsKey(x)) y.put(x, y.get(x) + 1);
        else y.put(x, 1);
    }
    static void remove(int x, TreeMap<Integer, Integer> y) {
        if (y.get(x) == 1) y.remove(x);
        else y.put(x, y.get(x) - 1);
    }
}
