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

public class CF {
    public static void main(String[] args) throws IOException {
        //BufferedReader br = new BufferedReader(new FileReader("input.txt"));
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());

        int[] arr = new int[n];
        st = new StringTokenizer(br.readLine());
        for (int i = 0; i < n; i++) {
            arr[i] = Integer.parseInt(st.nextToken());
        }

        pw.println(longestKgood(arr, k));
        pw.close();
    }

    private static String longestKgood(int[] arr, int k) {
        if (arr.length == 1) {
            return "1 1";
        }

        int bestL = 0;
        int bestR = 0;

        int l = 0;
        int r = 0;

        HashMap<Integer, Integer> count = new HashMap<>();
        count.put(arr[l], 1);

        for (; l < arr.length; l++) {
            if (l >= r) { // todo: check
                r = l;
                count = new HashMap<>();
                count.put(arr[l], 1);
            }

            while (r + 1 < arr.length && (count.size() < k || count.containsKey(arr[r + 1]))) {
                r++;
                if (!count.containsKey(arr[r])) count.put(arr[r], 0);
                count.put(arr[r], count.get(arr[r]) + 1);
            }

            //System.out.println(l + " " + r + " " + count);

            if (r - l > bestR - bestL) {
                bestL = l;
                bestR = r;
            }

            count.put(arr[l], count.get(arr[l]) - 1);
            if (count.get(arr[l]) == 0) {
                count.remove(arr[l]);
            }
        }

        return (bestL + 1) + " " + (bestR + 1);
    }
}

/*
20 5
19 6 7 14 7 10 6 3 7 8 3 5 4 12 4 1 16 5 15 1
 */