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

public class Segments {

	public static Integer[] parse(String st) {
		String[] a = st.split(" ");
		Integer[] ar = new Integer[a.length];
		for (int i = 0; i < a.length; i++) 
			ar[i] = Integer.parseInt(a[i]);
		return ar;
	}

	public static void solve(Integer[] a, Integer k) {
		int lc = 0;
		int rc = 0;
		int lb = 0;
		int rb = 0;
		int max = 0;
		int curr = 0;
		HashMap<Integer, Integer> n = new HashMap<>();
		for (rc = 0; rc < a.length; rc++) {
			if (n.containsKey(a[rc])) {
				n.put(a[rc], n.get(a[rc]) + 1);
			} else {
				n.put(a[rc], 1);
			}
			curr++;

			while (n.keySet().size() > k) {
				if (n.get(a[lc]).equals(1) ) {
					n.remove(a[lc]);
				} else {
					n.put(a[lc], n.get(a[lc]) - 1);
				}
				lc++;
				curr--;
			}
			if (curr > max) {
				max = curr;
				lb = lc;
				rb = rc;
			}
		}
		System.out.println( (lb + 1) + " " + (rb + 1) );
	}

	public static void main(String[] args) {
		try {
			InputStreamReader is = new InputStreamReader(System.in);
			BufferedReader br = new BufferedReader(is);
			Integer[] p = parse(br.readLine());
			Integer[] a = parse(br.readLine());
			solve(a, p[1]);
		} catch (Exception e) {e.printStackTrace();}
	}

}