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.IOException;
import java.util.HashMap;
import java.util.Map.Entry;

public class D616 {
	
	public static void main(String[] args) throws IOException{
		int[] arr = new int[nextInt()];
		int k = nextInt();
		
		for(int i=0; i<arr.length; i++){
			arr[i]=nextInt();
		}
		
		
		int l=0,r=1; //ukazateli
		int[] bestlr={0,0};
		HashMap<Integer,Integer> cnt = new HashMap<Integer,Integer>();
		cnt.put(arr[0], 1);
		int diffnums =1;
		
		while(r<arr.length){
			if(!cnt.containsKey(arr[r])||cnt.get(arr[r]).intValue()==0){
				diffnums++;
			}
			cnt.put(arr[r],(cnt.containsKey(arr[r])?cnt.get(arr[r]):0)+1);
			
			/*System.out.println(diffnums+" ["+(l+1)+";"+(r+1)+"]");
			for(Entry<Integer, Integer> i:cnt.entrySet()){
				System.out.println(i.getKey()+": "+i.getValue());
			}*/
			
			if(diffnums<=k){
				if(r-l>bestlr[1]-bestlr[0]){
					bestlr[0]=l;
					bestlr[1]=r;
				}
			}else{
				while(diffnums>k){
					cnt.put(arr[l],cnt.get(arr[l])-1);
					if(cnt.get(arr[l])==0) diffnums--;
					l++;
				}
			}
			r++;
		}
		
		System.out.println((bestlr[0]+1)+" "+(bestlr[1]+1));
	}

	private static int nextInt() throws IOException{
		StringBuilder ret = new StringBuilder();
		
		char c;
		while(Character.isSpaceChar(c=(char) System.in.read())||c=='\n');
		ret.append(c);
		while(Character.isDigit(c=(char) System.in.read())){
			ret.append(c);
		}
		
		return Integer.parseInt(ret.toString());
	}
}
