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


public class C620 {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);
		int n = Integer.parseInt(br.readLine());
		String[] types= br.readLine().split(" ");
		br.close();
		HashMap<Integer, Integer> type2Add = new HashMap<>();
		ArrayList<Point> pts = new ArrayList();
		int start = 0;
		for (int i = 0; i < types.length; i++) {
			int type = Integer.parseInt(types[i]);
			if (type2Add.containsKey(type)) {
				pts.add(new Point(start, i));
				type2Add.clear();
				start = i+1;
			} else {
				type2Add.put(type, i);
			}
		}
		int last = pts.size();
		if (last == 0) {
			pw.write("-1");
		} else {
			pts.get(last - 1).y = n -1; 
			pw.format("%d\n", last);
			for (int i = 0; i< last; i++) { 
				pw.format("%d %d\n", pts.get(i).x+1, pts.get(i).y+1);
			}
		}
		pw.flush();
		pw.close();

	}

}
