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 longestkgoodsegment;

import java.util.*;
import java.io.*;

public class longestkgoodsegment {
	public static void main(String[] args) throws IOException {
		BufferedReader fin = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(fin.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		int rightIndex = -1;
		int leftIndex = -1;
		int max = 0;
		int pointer = 0;
		st = new StringTokenizer(fin.readLine());
		HashMap<Integer, Integer> dict = new HashMap<Integer, Integer>();
		int[] nums = new int[n];
		for(int i = 0; i < n; i++) {
			nums[i] = Integer.parseInt(st.nextToken());
			dict.put(nums[i], dict.getOrDefault(nums[i], 0) + 1);
			while(dict.size() > k) {
				int next = nums[pointer];
				if(dict.get(next) == 1) {
					dict.remove(next);
				}
				else {
					dict.put(next, dict.get(next) - 1);
				}
				pointer ++;
			}
			int cur = i - pointer + 1;
			//System.out.println(cur + " " + pointer + " " + i);
			if(max < cur) {
				max = cur;
				rightIndex = i + 1;
				leftIndex = pointer + 1;
			}
		}
		System.out.println(leftIndex + " " + rightIndex);
	}
}
