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
//package codeforces.div2;

import java.util.HashMap;
import java.util.Scanner;

public class LongestkGoodSegment {

    static public void print(int arr[], int k) {

        HashMap<Integer, Integer> map = new HashMap<>();
        int max = Integer.MIN_VALUE;
        int left = 0;
        int right = 0;
        int start = 0;
        for(int i = 0; i < arr.length; i++) {
            int val = arr[i];
            if(map.containsKey(val)) {
                Integer local = map.get(val);
                map.put(arr[i], local + 1);
            } else {
                map.put(arr[i], 1);
            }
            if(map.size() <= k) {

                if((i - start) > max) {
                    max = i - start;
                    left = start;
                    right = i;
                }
            } else {
                if(map.size() > k) {
                    while (map.size() > k && start < arr.length) {
                        Integer val1 = arr[start];
                        if(map.get(val1) == 1) {
                            map.remove(val1);
                        } else {
                            Integer lo = map.get(val1);
                            map.put(arr[start], lo - 1);
                        }
                        start++;
                    }
                    if((i - start) > max) {
                        max = i - start;
                        left = start;
                        right = i;
                    }
                }
            }
        }
        left++;
        right++;
        System.out.println(left + " " + right);
    }

    public static void main(String []args) {

        Scanner sc  = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int i = 0;
        int arr[] = new int[n];
        while ( i < n) {
            arr[i++] = sc.nextInt();
        }
        print(arr, k);
    }
}
