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.io.*;
import java.util.*;
public class tree {
public static void main(String[] args) throws IOException {
	input.init(System.in);
	PrintWriter out = new PrintWriter(System.out);
	HashSet<Integer> s = new HashSet<Integer>();
	ArrayList<Integer> list = new ArrayList<Integer>();
	int n = input.nextInt();
	boolean found = false;
	for(int i=0;i<n;i++){
		if(s.size()==0){
			list.add(i+1);
		}
		int a = input.nextInt();
		if(s.contains(a)){
			found = true;
			list.add(i+1);
			s.clear();
		} else {
			s.add(a);
		}
	}
	if(found==false){
		out.println("-1");
	} else {
		//System.out.println(list);
		if(s.size()>0){
			list.set(list.size()-2,n);
			//System.out.println(list);
			//System.out.println("remove "+(list.size()-1));
			list.remove(list.size()-1);
		}
		out.println(list.size()/2);
		for(int i=0;i<list.size();i+=2){
			out.print(list.get(i)+ " " + list.get(i+1) + "\n");
		}
		out.println("");
	}
	out.close();
}

public static class input {
	static BufferedReader reader;
	static StringTokenizer tokenizer;

	static void init(InputStream input) {
		reader = new BufferedReader(new InputStreamReader(input));
		tokenizer = new StringTokenizer("");
	}

	static String next() throws IOException {
		while (!tokenizer.hasMoreTokens())
			tokenizer = new StringTokenizer(reader.readLine());
		return tokenizer.nextToken();
	}

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

	static double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

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