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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;


public class test {
	public static class FastReaderFile
    {
        BufferedReader br;
        StringTokenizer st;
        public FastReaderFile(InputStream in)
        {
            br = new BufferedReader(new
            InputStreamReader(in));
            
        }
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt()
        {
            return Integer.parseInt(next());
        }

        long nextLong()
        {
            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
    public static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(new
                                     InputStreamReader(System.in));
        }

        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt()
        {
            return Integer.parseInt(next());
        }

        long nextLong()
        {
            return Long.parseLong(next());
        }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
    public static PrintWriter out;
    static int ser ( int x[] , int start , int end , int val )
    {
        while ( start <= end )
        {
            int mid = ( start + end ) / 2 ;
            if ( x[mid] == val )
                return mid ;
            
            if ( x[ mid ] <= val )
                start = mid + 1 ;
            else
                end = mid - 1 ;
        }
        return -start - 1 ;
    }
    static  boolean isPrime( long n)
    {
        if (n < 2)  return false;
        if (n < 4)  return true;
        
        if (n%2 == 0 || n%3 == 0) return false;

        for (long i = 5 ; i * i <= n ; i = i + 6 )
            if ( n % i == 0 || n % ( i + 2 ) == 0)
                return false ;

        return true;
    }
    static long gcd(long a, long b) 
    {
        return b == 0 ? (a < 0 ? -a : a) : gcd(b, a % b);
    }
    static long lcm(long a, long b)
    {
        long lcm = (a / gcd(a, b)) * b;
        return lcm > 0 ? lcm : -lcm ;
    }
    static int search( int x[] , int val )
    {
        return ser( x , 0 , x.length - 1 , val  );
    }
    static String remove ( String s , int i )
    {
        return s.substring(0, i) + s.substring(i+1) ;
    }   
    

//            for (Map.Entry<Integer, Integer> e : x.entrySet()) 
//                        {
//                            e.getValue() , e.getKey

    public static void main(String[] args) throws FileNotFoundException {
//        TODO code application logic here
        FastReader in = new FastReader();
//        Scanner in = new Scanner(System.in) ;
//        FastReaderFile in = new FastReaderFile(new FileInputStream("fruits.in")) ;
//        StringBuilder r = new StringBuilder();
        out = new PrintWriter(new BufferedOutputStream(System.out), true) ;
        int n = in.nextInt() , k = in.nextInt() , j = 0 , max = 0 , st = 0 , end = 0 , c = 0 , i ;
        long x[] = new long[n] ;
        for ( i = 0 ; i < n ; ++i )
        	x[i] = in.nextLong() ;
        Map < Long , Integer > map = new HashMap();
        i = 0 ;
        while ( j < n )
        {
        	while ( j < n && map.size() < k || ( j < n && map.size() == k && map.containsKey(x[j]) ))
        	{
        		if ( map.containsKey(x[j]) )
        		map.put(x[j],  map.get(x[j]) + 1 ) ;
        		else map.put(x[j], 1) ;
        		++j ;
        		++c ;
        	}
//        	out.println(map);
        	if ( c > max )
        	{
        		max = c ;
        		st = i+1 ;
        		end = j ;
        	}
        	while ( map.size() >= k )
        	{
        		if ( map.get(x[i]) > 1 )
        			map.put(x[i], map.get(x[i]) - 1);
        		else
        			map.remove(x[i]) ;
        		++i ;
        		--c ;
        	}
        }
        out.println(st + " " + end);
    }
}
