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.StringTokenizer;

public class Main {
    private static int[] cnt = new int[1000100];
    
    public static void main(String[] args) throws IOException {
        for (int i = 0; i < 1000100; i++) {
            cnt[i] = 0;
        }
        ReaderF.init(System.in);
        int n = ReaderF.nextInt();
        int k = ReaderF.nextInt();

        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = ReaderF.nextInt();
        }

        int left = 0, right = -1;
        int ansLeft = Integer.MIN_VALUE, ansRight = Integer.MIN_VALUE;
        int tot = 0;

        while(true) {

            while(right < n) {

                right++;
                if(right == n) {
                    right--;
                    break;
                }
                int num = arr[right];
                cnt[num]++;

                if(cnt[num] == 1) {
                    if(tot == k) {
                        cnt[num]--;
                        right--;
                        break;
                    }
                    tot++;
                }

            }

//            System.out.println("left is " + left + " right is " + right);
            if(right - left + 1 >= ansRight - ansLeft + 1) {
                ansRight = right;
                ansLeft = left;
            }
            if(right == n - 1)
                break;

            while(left <= right) {
                int num = arr[left];
                cnt[num]--;
                left++;
                if(cnt[num] == 0) {
                    tot--;
                    break;
                }
            }
        }
        System.out.println("" + (ansLeft + 1) + " " + (ansRight + 1));
    }
}

class ReaderF {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            tokenizer = new StringTokenizer(
                    reader.readLine() );
        }
        return tokenizer.nextToken();
    }

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

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