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.io.*;
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
	File file = new File("in");
	BufferedReader in = new BufferedReader(file.exists() ? new FileReader(file) : new InputStreamReader(System.in));
	StringBuilder out = new StringBuilder("");
	String line, lines[];
	int n;
	n = Integer.parseInt(in.readLine());
	lines = in.readLine().split("\\s+");
	int types[] = new int[n];
	for( int i = 0; i < n; i++) types[i] = Integer.parseInt(lines[i]);
	Set<Integer> set = new TreeSet<Integer>();
	ArrayList<Integer> list = new ArrayList<Integer>();
	list.add(0);
	set.add(types[0]);
	for( int i = 1; i < n; i++ )
	{
		if ( set.contains(types[i]) )
		{
			list.add(i);
			set = new TreeSet<Integer>();
			if ( i == n-1 )
			{
				break;
			}
			else
			{
				list.add(i+1);
			}
			
		}
		else
		{
			set.add(types[i]);
		}
	}
	if ( list.size() == 1)
	{
		out.append("-1\n");
	}
	else
	{
		if ( list.size() % 2 == 1)
		{
			list.remove(list.size()-1);
			list.remove(list.size()-1);
			list.add(n-1);
		}
		out.append(((int)(list.size()/2))+"\n");
		for( int i = 0; i < list.size(); i+= 2) out.append((1+list.get(i))+" "+(1+list.get(i+1))+"\n");
	}
	System.out.print(out);
}
}
