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.util.*;
import java.io.*;
public class test
{
    public static void main(String [] args)throws IOException
    {InputStreamReader iy=new InputStreamReader(System.in);PrintWriter pw=new PrintWriter(System.out);
      BufferedReader br=new BufferedReader(iy);
      int n=Integer.parseInt(br.readLine());
      String s[]=br.readLine().split(" ");
     int ar[]=new int[n];
     for(int i=0;i<n;i++)
     {
         ar[i]=Integer.parseInt(s[i]);}
         ArrayList<int[]> res=new ArrayList<int[]>();
        HashSet<Integer> h=new HashSet<Integer>();
      int split=0;int st=1;
      for(int i=0;i<n;i++)
      {
          if(h.contains(ar[i]))
          {
              split+=1;
              res.add(new int[]{st,i+1});
            h.clear();
        st=i+2;}
        else
        h.add(ar[i]);
    }
    if(split==0){
    pw.println(-1); pw.flush();}
    else{pw.println(split);
    for(int i=0;i<res.size();i++)
    {
        if(i==res.size()-1)
        {
            int ff[]=res.get(i);
            int one=ff[0];int two=ff[1];
            if(two!=n)
            pw.println(one+" "+n);
            else
            pw.println(one+" "+two);
        }
        else{
            int ff[]=res.get(i);
            int one=ff[0];int two=ff[1];
        pw.println(one+" "+two);}}
    pw.flush();}}}
        
              