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

public class P620_C {
  public static void main(String[] args) throws IOException {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    int n = Integer.parseInt(reader.readLine());
    String[] arr = reader.readLine().split(" ");
    Set<String> set = new HashSet<>();
    List<Integer> open = new ArrayList<>();
    List<Integer> close = new ArrayList<>();
    int prev = 0;
    for (int i = 0; i < n; i++) {
      if (set.contains(arr[i])) {
        open.add(prev + 1);
        close.add(i + 1);
        set = new HashSet<>();
        prev = i + 1;
      } else {
        set.add(arr[i]);
      }
    }
    if (open.size() > 0 && prev < n) {
      close.set(close.size() - 1, n);
    }
    if (open.size() == 0) {
      System.out.println("-1");
    } else {
      System.out.println(open.size());
      PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out), true);
      for (int i = 0; i < open.size(); i++) {
        writer.println(open.get(i) + " " + close.get(i));
      }
    }
  }
}