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 d 
{
	public static void main(String[] arg) throws IOException
	{
		new d();
	}
	public d() throws IOException
	{
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int n = in.nextInt();
		int k = in.nextInt();
		int[] arr = new int[n];
		int[] freq = new int[1_000_001];
		for(int i = 0; i < n; i++) arr[i] = in.nextInt();
		int right = 0;
		int count = 0;
		int op1 = 0;
		int op2 = 1;
		for(int i = 0; i < n; i++)
		{
			while(count <= k && right < n)
			{
				if(count == k && freq[arr[right]] == 0) break;
				if(freq[arr[right]] == 0) count++;
				freq[arr[right++]]++;
			}
			if(right-i > op2-op1)
			{
				op1 = i;
				op2 = right;
			}
			if(freq[arr[i]] == 1)
			{
				count--;
			}
			freq[arr[i]]--;
		}
		out.println(op1+1 + " " + op2);
		in.close(); out.close();
	}
	class FastScanner
	{
		BufferedReader br;
		StringTokenizer st;
		public FastScanner(InputStream in)
		{
			br = new BufferedReader(new InputStreamReader(in));
			st = new StringTokenizer("");
		}
		public String next() throws IOException
		{
			while(!st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int nextInt() throws IOException
		{
			return Integer.parseInt(next());
		}
		public void close() throws IOException
		{
			br.close();
		}
	}
}
