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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class KGood {

    static int[] counter_array = new int[1000001];
    static int current_diff_count;

    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));

        int n = sc.nextInt(); // read input as integer
        int k = sc.nextInt(); // read input as long
        int[] input = new int[n];
        for (int i = 0; i < n; i++) {
            input[i] = sc.nextInt();
        }
        /*
         * if (n == k) { out.print(1 + " " + n); } else if (k == 1) {
         * out.print(1 + " " + 1);
         */

        int max_start = -1, max_end = -1;
        add(input[0]);
        int end = 1;
        for (int start = 0; start < n; start++) {
            while (end < n) {
                add(input[end]);
                if (current_diff_count > k) {
                    remove(input[end]);
                    break;
                }
                end++;
            }
            if (max_end - max_start < end - 1 - start) {
                max_start = start + 1;
                max_end = end;
            }
            remove(input[start]);
        }
        if(max_start == -1) max_start = 1;
        if (max_end == -1) max_end = 1;
        out.print(max_start + " " + max_end);
        // Stop writing your solution here.
        // -------------------------------------
        out.close();
    }

    private static void add(int v) {
        counter_array[v]++;
        if (counter_array[v] == 1) {
            current_diff_count++;
        }

    }

    private static void remove(int v) {
        counter_array[v]--;
        if (counter_array[v] == 0) {
            current_diff_count--;
        }
    }

    // -----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;

    // -----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }

}
