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

public class pearlsInARow {
	FastScanner in;
	PrintWriter out;

	public void solve() throws IOException {

		int count = 0;
		int length = in.nextInt();
		HashMap<Integer, Integer> counter = new HashMap<>();

		HashMap<Integer, String> recordKeeper = new HashMap<>();
		ArrayList<String> print = new ArrayList<>();
		int cut = 1;

		for (int i = 1; i <= length; i++) {

			int num = in.nextInt();
			if (counter.get(num) == null) {
				counter.put(num, 0);
			}
			int current = counter.get(num);

			if (current > 0) {

				counter.put(num, current - 1);

				print.add(Integer.toString(cut) +" "+ Integer.toString(i));

				recordKeeper.clear();
				counter.clear();
				count++;
				cut = i + 1;

			} else {

				counter.put(num, current + 1);

			}

		}

		if (count == 0) {
			System.out.println("-1");
		} else {

			String[] splitter= print.get(print.size() - 1).split(" ");

			print.remove(print.size()-1);
			print.add(splitter[0]+" "+length);

			System.out.println(count);
			for(String p:print){
				System.out.println(p);
			}
		}

	}

	public void run() {
		try {
			in = new FastScanner(new File(".in"));
			out = new PrintWriter(new File(".out"));

			solve();

			out.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		FastScanner(File f) {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}
	}

	public static void main(String[] arg) {
		new pearlsInARow().run();
	}
}