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 boolean checkPossible(int array[]){
	HashSet<Integer>set = new HashSet<Integer>();
	for(int i = 0;i < array.length;i++){
		if(set.contains(array[i]))
			return false;
		set.add(array[i]);
	}
	return true;
}
public static void main(String [] args)throws Exception{
	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	int n = Integer.parseInt(br.readLine());
	int array[] = new int[n];
	StringTokenizer st = new StringTokenizer(br.readLine());
	for(int i = 0;i < n;i++){
		array[i] = Integer.parseInt(st.nextToken());
	}
	if(checkPossible(array)){
		System.out.println("-1");
		return;
	}
	ArrayList<Integer>start = new ArrayList<Integer>();
	ArrayList<Integer>end = new ArrayList<Integer>();
	HashSet<Integer>set = new HashSet<Integer>();
	int temstart = 0;
	for(int i = 0;i < n;i++){
		if(set.contains(array[i])){
			set = new HashSet<Integer>();
			start.add(temstart + 1);
			end.add(i + 1);
			temstart = i + 1;
		}
		else set.add(array[i]);
	}
	StringBuilder sb = new StringBuilder();
	for(int i = 0;i < start.size() - 1;i++){
		sb.append(start.get(i) + " " + end.get(i));
		sb.append('\n');
	}
	if(temstart == n)
		sb.append(start.get(start.size() - 1) + " " + end.get(end.size() - 1));
	else sb.append(start.get(start.size() - 1) + " " + n);
	System.out.println(start.size());
	System.out.println(sb);
}
}