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.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;

public class Main {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);

        String[] split = in.readLine().split(" ");
        int N = Integer.parseInt(split[0]);
        int K = Integer.parseInt(split[1]);

        int[] values = new int[N];
        split = in.readLine().split(" ");
        for(int i = 0; i < N; i++) {
            values[i] = Integer.parseInt(split[i]);
        }

        Map<Integer, Integer> currentValues = new HashMap<>();
        int solution = 0;
        int solutionLeft = 0;
        int solutionRight = 0;
        int left = 0;
        for(int right = 0; right < N; right++) {
            currentValues.put(values[right], currentValues.getOrDefault(values[right], 0) + 1);
            while(currentValues.size() > K) {
                int cnt = currentValues.get(values[left]);
                if(cnt == 1) {
                    currentValues.remove(values[left]);
                } else {
                    currentValues.put(values[left], cnt - 1);
                }
                ++left;
            }
            if(solution < right-left+1) {
                solution = right-left+1;
                solutionLeft = left + 1;
                solutionRight = right + 1;
            }
        }
        out.println(solutionLeft + " " + solutionRight);

        in.close();
        out.close();
    }
}