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.awt.Point;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;

public class D {

	static long plaf = (long) 25 * 100000000;
	static Point[] t;

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

	public static String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(br.readLine());
		}
		return st.nextToken();
	}

	public static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	public static long nextLong() throws IOException {
		return Long.parseLong(next());
	}

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

		int res = 0;

		int n = nextInt(), k = nextInt();

		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			int val = nextInt();
			a[i] = val;
		}

		int l = 0, r = 0;
		int nbr = 0;
		int max = Integer.MIN_VALUE;
		Point p = new Point(0, 0);
		HashMap<Integer, Integer> map = new HashMap<>();
		while (r < n) {
			Integer count = map.get(a[r]);

			if (count != null && count != 0) {
				map.put(a[r], count + 1);
			} else {
				map.put(a[r], 1);
				nbr++;
			}

			if (nbr > k) {
				do {
					count = map.get(a[l]);
					map.put(a[l], count - 1);
					l++;
				} while (count != 1) ;
				nbr--;
				r++;
				
			} else {
				if (r - l + 1 > max) {
					max = r - l + 1;
					p.x = l + 1;
					p.y = r + 1;
				}
				r++;
			}

		}

		// output
		System.out.println(p.x + " " + p.y);
	}

}