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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.StringTokenizer;

public class C {

	static class Segment { 
		int l,r, num;

		public Segment(int l, int r, int num) { 
			this.l = l;
			this.r = r;
			this.num = num;
		}
	}

	public static void main(String [] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

		int N = Integer.parseInt(br.readLine());

		int [] a = new int[N];
		StringTokenizer tokenizer = new StringTokenizer(br.readLine());

		for(int i=0; i<N; i++) { 	
			a[i] = Integer.parseInt(tokenizer.nextToken());
		}
		
		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();

		List<Segment> segments = new ArrayList<Segment>();
		
		
		for(int i=0; i<N; i++) { 
			Integer num = a[i];	
			Integer l = map.get(num);

			if(l == null) { 
				map.put(num, i);
			} else { 
				//System.out.println("Khm..");
				if(segments.size() == 0) { 
					Segment nS = new Segment(0, i, num);
					segments.add(nS);
				} else { 
					Segment lS = segments.get(segments.size() - 1);
					Segment nS = new Segment(lS.r + 1, i,num);
					segments.add(nS); 
				}
				map = new HashMap<Integer, Integer>();
			}
		}
		// .. 1 …. 1 .. 5 … 5 … 5 .. 
		if(segments.size() == 0) { 
			//System.out.println("shit");
			bw.write("-1");
			bw.newLine();
		} else { 
			
			Segment lS = segments.get(segments.size() - 1);
			lS.r = N-1;
			
			bw.write("" + segments.size());
			bw.newLine();
			for(Segment s : segments) { 
				bw.write(String.format("%d %d", s.l + 1, s.r + 1));
				bw.newLine();
			}
			
		}
		
		bw.flush();
		bw.close();

	}
}