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.BufferedInputStream;
import java.io.IOException;
import java.io.InputStream;


public class Codeforces616d {

    static int n, k;
    static int maxLen;
    static int left, right;
    static int l, r;
    static int array[];
    static int count[]=new int[1000000];
    static int difVals = 0;


    private static int readInt(InputStream in) throws IOException {
        int ret = 0;
        boolean dig = false;

        for (int c = 0; (c = in.read()) != -1; ) {
            if (c >= '0' && c <= '9') {
                dig = true;
                ret = ret * 10 + c - '0';
            } else if (dig) break;
        }

        return ret;
    }

    public static void main(String[] args) throws IOException {
        BufferedInputStream br = new BufferedInputStream(System.in);
        n = readInt(br);
        k = readInt(br);

        array = new int[n];


        for (int i = 0; i < n; i++) {
            array[i] = readInt(br);

            if (count[array[i]] == 0) {
                count[array[i]] = 1;
                difVals++;
            } else {
                count[array[i]]++;
            }

            while (difVals > k) {
                count[array[l]]--;
                if (count[array[l]] == 0) difVals--;
                l++;
            }

            if (i - l + 1 > maxLen) {
                maxLen = i - l + 1;
                left = l;
                right = i;

            }
        }
        System.out.println((left+1) + " " + (right+1));

    }


}
