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

public class PearlsInARow {

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

		int n = Integer.parseInt(br.readLine());
		String[] tmp = br.readLine().split("\\s+");

		int[] pearls = new int[n + 1];
		for (int i = 1; i < n + 1; i++) {
			pearls[i] = Integer.parseInt(tmp[i - 1]);
		}

		Set<Integer> match = new HashSet<Integer>();
		Range[] res = new Range[n / 2];
		int residx = 0;
		// List<Range> res = new ArrayList<Range>();
		int idx = 1;
		for (int i = 1; i < n + 1; i++) {
			if (match.contains(pearls[i])) {
				res[residx++] = new Range(idx, i);
				// res.add(new Range(idx, i));
				match.clear();
				idx = i + 1;
			} else {
				match.add(pearls[i]);
			}
		}

		if (residx == 0) {
			System.out.println(-1);
		} else {
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < residx; i++) {
				Range r = res[i];
				if (i == residx - 1) {
					sb.append(String.format("%d %d", r.l, n));
				} else {
					sb.append(String.format("%d %d\n", r.l, r.r));
				}
			}

			System.out.println(residx);
			System.out.println(sb);
		}
	}

	static class Range {
		int l, r;

		Range(int l, int r) {
			this.l = l;
			this.r = r;
		}
	}

}