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 Main {
static int start;
static int end;
public static void main(String [] args)throws Exception{
	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	StringTokenizer st = new StringTokenizer(br.readLine());
	int n = Integer.parseInt(st.nextToken());
	int k = Integer.parseInt(st.nextToken());
	st = new StringTokenizer(br.readLine());
	int array[] = new int[n + 1];
	start = 0;
	end = 0;
	for(int i = 1;i <= n;i++)
		array[i] = Integer.parseInt(st.nextToken());

    int max = 0;
	int l = 1;
	int r = 1;
	HashMap<Integer,Integer>map = new HashMap<Integer,Integer>();
	while(r <= n){
	        if(!map.containsKey(array[r]))
			map.put(array[r],1);
			else map.put(array[r],map.get(array[r]) + 1);
			if(map.size() <= k && max < r - l + 1){
				start = l;
				end = r;
				max = r - l + 1;
			}
			++r;
			while(map.size() > k){
				map.put(array[l],map.get(array[l]) - 1);
				if(map.get(array[l]) == 0)
			    map.remove(array[l]);
			    ++l;
			}
	}
	System.out.println(start + " " + end);
}
}