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

public class Main {

    public static void main(String[] args) throws Exception {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter printWriter = new PrintWriter(System.out);
        Solve TaskSolve = new Solve();
        TaskSolve.main(bufferedReader, printWriter);
        bufferedReader.close();
        printWriter.close();
    }

	static class Solve {

        private int size;
        private int param;

        public void main(BufferedReader bufferedReader, PrintWriter printWriter) throws IOException {

            StringTokenizer stringTokenizer = new StringTokenizer(bufferedReader.readLine());

            size = Integer.parseInt(stringTokenizer.nextToken());
            param = Integer.parseInt(stringTokenizer.nextToken());

            int number[] = new int[500050];

            stringTokenizer = new StringTokenizer(bufferedReader.readLine());

            for(int itterator = 0; itterator < size; itterator++) {
                number[itterator] = Integer.parseInt(stringTokenizer.nextToken());
            }

            int cnt[] = new int[1000010];
            int left = 0, right = -1, cntDiff = 0;
            int bestLeft = 0, bestRight = -1, bestSum = 0;

            while(right < size - 1) {

                right++;

                if(cnt[number[right]] == 0) {
                    cntDiff++;
                }
                cnt[number[right]]++;

                while(cntDiff > param) {
                    cnt[number[left]]--;
                    if(cnt[number[left]] == 0) cntDiff--;
                    left++;
                }

                if(right - left > bestRight - bestLeft) {
                    bestLeft = left;
                    bestRight = right;
                }
            }

            printWriter.print((bestLeft + 1) + " " + (bestRight + 1));

            bufferedReader.close();
            printWriter.close();
        }
    }
}