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.util.*;
import java.io.*;

public class LongestkGoodSegment {

	// https://codeforces.com/contest/616/problem/D
	
	public static void main(String[] args) throws IOException, FileNotFoundException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		//BufferedReader in = new BufferedReader(new FileReader("LongestkGoodSegment"));

		StringTokenizer st = new StringTokenizer(in.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		int[] arr = new int[n];
		st = new StringTokenizer(in.readLine());
		for (int i=0; i<n; i++) arr[i] = Integer.parseInt(st.nextToken());
		
		HashMap<Integer, Integer> map= new HashMap<>();
		int pointer=0;
		map.put(arr[0], 1);
		int[] largest_interval = new int[] {0,0};
		for (int i=1; i<n; i++) {
			map.put(arr[i], map.getOrDefault(arr[i], 0)+1);
			while (map.size() > k) {
				map.put(arr[pointer], map.get(arr[pointer])-1);
				if (map.get(arr[pointer]) <= 0) map.remove(arr[pointer]);
				pointer++;
			}
			if (i - pointer+1 > largest_interval[1] - largest_interval[0] + 1) {
				largest_interval[0] = pointer;
				largest_interval[1] = i;
			}
		}
		
		System.out.println(largest_interval[0]+1 + " " + (largest_interval[1]+1));
		
	}
}