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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.StringTokenizer;

 public class Test
 {
     static PrintWriter pw = new PrintWriter(System.out);
     static class Pair{
         int L , R;
         Pair(int a , int b)
         {
             L = a; R = b;
         }
         
         public String toString(){
             return (L + " " + R);
         }
     }
     
     public static void main(String[] args)throws Exception
     {
         Reader.init(System.in);
         int n = Reader.nextInt();
         ArrayList<Pair> list = new ArrayList();
         HashSet<Integer> good = new HashSet();
         
         int L = 1;
         for(int i = 1 ; i<=n ; i++){
           int x =  Reader.nextInt();
           if(good.contains(x))
           {
               list.add(new Pair(L , i));
               good.clear();
               L = i+1;
           }
           else
               good.add(x);
         }
         
         if(!list.isEmpty() && !good.isEmpty()){
             Pair p = list.get(list.size()-1);
             list.set(list.size()-1, new Pair(p.L , n));
         }
         
         if(list.isEmpty())
             pw.print(-1);
         else
         {
             pw.println(list.size());
             for(int i = 0 ; i<list.size() ; i++)
                 pw.println(list.get(i));
         }
         
         
         pw.close();
         
     }
     
 }
class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

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

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