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 D
{
	public static void main(String[] args) throws Exception
	{
		FastScanner in = new FastScanner(System.in);
		
		int n = in.nextInt();
		int k = in.nextInt();
		
		int[] array = new int[n];
		for(int x = 0; x < n; x++)
		{
			array[x] = in.nextInt();
		}
		
		MultiSet ms = new MultiSet();
		int index = 0;
		
		int best = 0;
		int left = -1;
		int right = -1;
		for(int y = 0; y < array.length; y++)
		{
			while(index < array.length)
			{
				ms.add(array[index]);
				
				if(ms.size() > k)
				{
					ms.remove(array[index]);
					break;
				}
				
				index++;
			}
			
			if(index - y > best)
			{
				best = index - y;
				left = y + 1;
				right = index;
			}
			
			ms.remove(array[y]);
		}
		
		System.out.println(left + " " + right);
	}
	
	static class MultiSet
	{
		HashMap<Integer, Integer> map;
		
		public MultiSet()
		{
			map = new HashMap<Integer, Integer>();
		}
		
		public void add(int val)
		{
			if(!map.containsKey(val))
			{
				map.put(val, 1);
			}
			else
			{
				map.put(val, map.get(val) + 1);
			}
		}
		
		public void remove(int val)
		{
			map.put(val, map.get(val) - 1);
			if(map.get(val) == 0)
			{
				map.remove(val);
			}
		}
		
		public int size()
		{
			return map.size();
		}
	}
	
	static class FastScanner
	{
		BufferedReader br;
		StringTokenizer st;
		
		public FastScanner(InputStream input)
		{
			br = new BufferedReader(new InputStreamReader(input));
			st = new StringTokenizer("");
		}
		
		public String next() throws IOException
		{
			if(st.hasMoreTokens())
			{
				return st.nextToken();
			}
			else
			{
				st = new StringTokenizer(br.readLine());
				return next();
			}
		}
		
		public int nextInt() throws IOException
		{
			return Integer.parseInt(next());
		}
	}
}