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.HashMap;
import java.util.StringTokenizer;

public class Pearls {
  public static void main(String[] args) throws IOException {
    BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));

    int pearls = Integer.parseInt(bf.readLine());
    StringTokenizer st = new StringTokenizer(bf.readLine());
    int segments = 0;
    int[] last = {0, 0};
    HashMap<Integer, Integer> sofar = new HashMap<>();
    StringBuilder sb = new StringBuilder();
    for (int i = 1; i <= pearls; i++) {
      Integer old = sofar.put(Integer.parseInt(st.nextToken()), i);
      if (old != null) {
        if (last[1] != 0) {
          sb.append(last[0]);
          sb.append(' ');
          sb.append(last[1]);
          sb.append('\n');
        }
        sofar.clear();
        segments++;
        last[0] = last[1] + 1;
        last[1] = i;
      }
    }
    bf.close();

    if (segments == 0) {
      System.out.println(-1);
    } else {
      PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
      out.println(segments);
      sb.append(last[0]);
      sb.append(' ');
      sb.append(pearls);
      out.println(sb);
      out.close();
    }
  }
}