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.*;
     
    public class Main
    {
        public static void main (String[] args) 
        {
            Scanner in=new Scanner(System.in);
            HashSet<Long> SET= new HashSet<Long>();
        	ArrayList<Long> list=new ArrayList<Long>();
            	long t=1,k,l,m;
            	int n=in.nextInt();
            	long a[] = new long[n];
            	for(int i=0;i<n;i++)
            a[i]=in.nextLong();
           
            	for(int i=0;i<n;i++)
            	{
            		k=SET.size();
            		SET.add(a[i]);
            		l=SET.size();
             
            		if(k==l)
            		{
            			list.add(t);
            			list.add(i+1L);
            			t=2+i;
            			SET.clear();
            		}
             
            	}
            	int sz=list.size();
             
            	if(sz>0){
            	m=list.get(sz-1);
            	if(m!=n)
            	{
            		list.remove(sz-1);
            		list.add((long)n);
            	}
            	}
             
            	if(sz==0)
            	System.out.println("-1");
            	else
            	{
            		
            		System.out.println(sz/2);
            		for(int i=0;i<sz;i+=2)
            		{
            			System.out.println(list.get(i)+" "+list.get(i+1));
            		}
             
            	}
             

        }

    }