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.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class C implements Closeable {

    private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    private PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out), true);

    @Override
    public void close() throws IOException {
        in.close();
        out.close();
    }

    void solve() throws IOException {
        int n = Integer.parseInt(in.readLine());
        Set<Integer> used = new HashSet<>();
        String[] line = in.readLine().split("\\s+");
        List<int[]> result = new ArrayList<>();
        int start = 1;
        for (int i = 1; i <= n; i++) {
            int next = Integer.parseInt(line[i - 1]);
            if (!used.contains(next)) {
                 used.add(next);
            } else {
                result.add(new int[]{start, i});
                used = new HashSet<>();
                start = i + 1;
            }
        }
        if (result.size() == 0) {
            out.println(-1);
        } else {
            int k = result.size();
            if (start != k) {
                int[] last = result.get(k - 1);
                result.remove(k - 1);
                result.add(new int[]{last[0], n});
            }
            out.println(result.size());
            for (int[] r : result) {
                out.print(r[0] + " " + r[1]);
                out.print("\n");
            }
            out.println();
        }

    }

    public static void main(String[] args) throws IOException {
        new C().solve();
    }

}