Problem: 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

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class hq {

    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
        StringTokenizer tk = new StringTokenizer(bf.readLine());
        int n = Integer.parseInt(tk.nextToken());
        int k = Integer.parseInt(tk.nextToken());
        int[] a = new int[n];
        tk = new StringTokenizer(bf.readLine());
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(tk.nextToken());
        }
        Map<Integer, Integer> hm = new HashMap<>();
        int max = Integer.MIN_VALUE, l = 0, r = 0, x = -1, y = -1;
        for (; r < n; r++) {
            if (hm.containsKey(a[r])) {
                hm.put(a[r], hm.get(a[r]) + 1);
            } else {
                hm.put(a[r], 1);
            }
            if (l < n && hm.size() > k) {
                while (hm.size() > k) {
                    if (hm.get(a[l]) == 1) {
                        hm.remove(a[l]);
                    } else {
                        hm.put(a[l], hm.get(a[l]) - 1);
                    }
                    l++;
                }
            }

            if (r - l + 1 > max) {
                max = r - l + 1;
                x = l;
                y = r;
            }
        }
        x++;
	y++;
        out.write(x+" "+y);
        out.flush();
    }

}