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.*;
public class tG{
    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        int k=in.nextInt();

        int[] ar=new int[n];

        for(int i=0;i<ar.length;i++) ar[i]=in.nextInt();

        HashMap<Integer,Integer> map=new HashMap<>();

        map.put(ar[0],1);

        Pair p=new Pair(1,1);

        int left=1,right=1,range=1;


        for(int i=1;i<n;i++){
            map.put(ar[i],map.getOrDefault(ar[i],0)+1);

            if(map.size()<=k) right+=1;
            else{
                map.put(ar[left-1],map.get(ar[left-1])-1);

                if(map.get(ar[left-1])==0) map.remove(ar[left-1]);

                left++;
                right=i+1;
            }

            if(range<right-left+1){
                range=right-left+1;
                p.a=left;
                p.b=right;
            }
        }

        System.out.println(p.a+" "+p.b);
    }
}

class Pair{
    int a;
    int b;

    Pair(int a,int b){
        this.a=a;
        this.b=b;
    }
}