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.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * Created by selin on 22.1.2016.
 */
public class CF_620_C {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] nums = new int[n];
        Set<Integer> set = new HashSet<>();
        ArrayList<int[]> res = new ArrayList<>();
        int start=0, len =0;
        for (int i = 0; i < n; i++) {
            nums[i] = in.nextInt();
            if(!set.contains(nums[i])){
                set.add(nums[i]);
                len++;
            }
            else{
                res.add(new int[]{start+1, start+len+1});
                start = start+len+1;
                len=0;
                set = new HashSet<>();
            }
        }
        if(res.size() == 0){
            System.out.println(-1);
        }
        else {
            System.out.println(res.size());
            int[] end = res.get(res.size()-1);
            end[1] = n;
            res.set(res.size()-1, end);
            for (int i = 0; i < res.size(); i++) {
                System.out.println(res.get(i)[0] + " " + res.get(i)[1]);
            }
        }
    }
}
