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.io.*;
import java.util.*;
/**
 *
 * @author Sourav Kumar Paul
 */
public class LongestKGoodSegment {
    public static void main(String[] args) throws IOException{
        Reader in = new Reader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        
        int n =in.nextInt();
        int k = in.nextInt();
        int x = 0;
        int arr[] = new int[n];
        for(int i=0; i<n; i++)
            arr[i] = in.nextInt();
        int maxL=0, maxR = 0, tL = 0;
        int count = 0;
        int hash[ ] =new int[1000000+5];
        while(x<n)
        {
            if(hash[arr[x]] == 0)
            {
                count++;
                
            }
            hash[arr[x]]++;
            if(count>k)
            {
                hash[arr[tL]] --;
                if(hash[arr[tL]] == 0)
                    count--;
                tL++;
            }
            if(x-tL+1 > maxR-maxL+1)
            {
                maxL = tL;
                maxR = x;
            }
            x++;
            
        }
        out.println((maxL+1)+ " "+(maxR+1));
        out.flush();
        out.close();
    }
    public static class Reader {
        public BufferedReader reader;
        public StringTokenizer st;

        public Reader(InputStreamReader stream) {
            reader = new BufferedReader(stream);
            st = null;
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public String nextLine() throws IOException{
            return reader.readLine();
        }
        public long nextLong(){
            return Long.parseLong(next());
        }
        public double nextDouble(){
            return Double.parseDouble(next());
        }

    }
}