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.IOException;
import java.io.InputStreamReader;
import java.io.Reader;
import java.math.BigInteger;
import java.util.HashMap;
import java.util.Scanner;
import java.util.StringTokenizer;


public class CFProbD {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		int n = input.nextInt();
		int differentNumbers = input.nextInt();
		int[] numbers = new int[n];
		for(int a = 0; a < n; a++){
			numbers[a] = input.nextInt();
		}
		
		int[] freqDist = new int[1000005];
		int num = 0;
		int start = 0;
		int recordLength = 0;
		int recordStart = -1;
		int recordEnd = -1;
		for(int b = 0; b < n; b++){
			freqDist[numbers[b]]++;
			if(freqDist[numbers[b]] == 1){
				num++;
			}
			if(num <= differentNumbers){
				//record possibility
				if(recordLength < b - start + 1){
					recordLength = b - start + 1;
					recordStart = start;
					recordEnd = b;
				}
			}
			while(num > differentNumbers){
				freqDist[numbers[start]]--;
				if(freqDist[numbers[start]] == 0){
					num--;
				}
				start++;
			}			
		}
		System.out.println((recordStart+1) + " " + (recordEnd+1));
		
		
	}
}