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.util.*;
import java.io.*;

public class LongestKgoodSegment {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), k = in.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt();
        }
        int max = Integer.MIN_VALUE, l = 0, x = -1, y = -1;

        Map<Integer, Integer> map = new HashMap<>();
        for (int i=0; i < n; i++) {
            int r=i;
            if (map.containsKey(a[r])) {
                map.put(a[r], map.get(a[r]) + 1);
            } else {
                map.put(a[r], 1);
            }
            if ( map.size() >= k) {
                while (map.size() > k) {
                    if (map.get(a[l]) == 1) {
                        map.remove(a[l]);
                    } else {
                        map.put(a[l], map.get(a[l]) - 1);
                    }
                    l++;
                }//while
            }
            if (r - l + 1 > max) {
                max = r - l + 1;
                x = l;
                y = r;
            }
        }//for
        x++;
        y++;
        System.out.println(x + " " + y);

    }//psvm
}//class
