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.Scanner;
import java.io.*;
import java.util.*;
import java.math.*;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;

public class C {
    public static void main(String[] args) throws IOException {
        in = new StreamTokenizer( new InputStreamReader( System.in ) );
        // InputReader ir = new InputReader(System.in);

        //BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        int n = nextInt();
        int[] arr = new int[n];
        for(int i=0;i<n;i++)
           arr[i] = nextInt();
        HashSet<Integer> valz = new HashSet<Integer>();
        int count = 0;
        int[] start = new int[n];
        int[] end = new int[n];
        int st = 0;
        int en = 0;
        for(int i=0;i<n;i++) {
            if(valz.isEmpty()){
                st = i;
            }
            if(valz.contains(arr[i])) {
                count++;
                start[count-1] = st;
                end[count-1]= i;
                valz.clear();
            } else {
                valz.add(arr[i]);
            }
        }
        
        
        if(count > 0) {
            end[count-1] = n-1;
            out.println(count);
            for(int i =0;i<count;i++) 
               out.println((start[i]+1) + " " + (end[i]+1));
        } else {
            out.println(-1);
        }
        out.close();
    }

    static StreamTokenizer in;
    static PrintWriter out;
    

    static int nextInt() throws IOException {
        in.nextToken();
        return ( int ) in.nval;
    }
    
    static long nextLong() throws IOException {
        in.nextToken();
        return ( long) in.nval;
    }
    
    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

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

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }

    
}