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.io.*;
import java.util.*;

public class Main {

    private static PrintWriter out = new PrintWriter(System.out);
    private static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    private static StringTokenizer st;

    public static void main(String[] args) throws IOException {

        ArrayList<Pair> ans = new ArrayList<>();
        Set<Integer> u = new HashSet<>();

        int n = Integer.parseInt(in.readLine());

        int[] a = new int[n];

        st = new StringTokenizer(in.readLine());

        for (int i = 0; i < n; i++) a[i] = Integer.parseInt(st.nextToken());

        int l = 1;

        for (int i = 0; i < n; i++) {

            if (u.contains(a[i])) {
                ans.add(new Pair(l, i + 1)); u.clear(); l = i + 2;

            } else u.add(a[i]);
        }

        if (ans.size() == 0)
            out.println(-1);
        else{

            ans.get(ans.size() - 1).s = n;

            out.println(ans.size());
            for(int i = 0; i < ans.size(); i++)
                out.println(ans.get(i).f + " " + ans.get(i).s);
        }

        out.flush();
    }

    static class Pair{

        int f, s;

        public Pair(int a, int b){
            f = a; s = b;
        }
    }
}