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.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.NavigableMap;
import java.util.TreeMap;


public class D {
	public static void main(String[] args) throws Exception {
		try (FastScanner s = new FastScanner(System.in);
				PrintWriter pw = new PrintWriter(System.out);) {
			final int n = s.nextInt();
			final int k = s.nextInt();
			final int[] a = new int[n];
			for (int i = 0; i < n; ++i) {
				a[i] = s.nextInt();
			}
			final Map<Integer, Integer> map = new HashMap<>();
			final NavigableMap<Integer, Integer> rmap = new TreeMap<>();
			int i = 0;
			int j = 1;
			int maxi = i;
			int maxj = i;
			int maxl = 1;
			map.put(a[0], 0);
			rmap.put(0, a[0]);
			while (j < n) {
				Integer pos = map.get(a[j]);
				if (pos != null) {
					rmap.remove(pos);
					rmap.put(j, a[j]);
					map.put(a[j], j);
				} else if (map.size() < k) {
					rmap.put(j, a[j]);
					map.put(a[j], j);
				} else {
					final int l = j - i;
					if (l > maxl) {
						maxl = l;
						maxi = i;
						maxj = j - 1;
					}
					final Map.Entry<Integer, Integer> e = rmap.firstEntry();
					i = e.getKey() + 1;
					rmap.remove(e.getKey());
					map.remove(e.getValue());
					rmap.put(j, a[j]);
					map.put(a[j], j);
				}
				j++;
			}
			final int l = j - i;
			if (l > maxl) {
				maxl = l;
				maxi = i;
				maxj = j - 1;
			}
			pw.println((maxi + 1) + " " + (maxj + 1));
		}
	}
	
	private static final class FastScanner implements AutoCloseable {
		private final BufferedReader reader;
		private String[] tokens;
		private int next;
		
		FastScanner(InputStream is) {
			reader = new BufferedReader(new InputStreamReader(is));
		}
		
		int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		String next() throws IOException {
			if (tokens == null || next == tokens.length) {
				tokens = reader.readLine().split(" ");
				next = 0;
			}
			return tokens[next++];
		}

		@Override
		public void close() throws Exception {
			reader.close();
		}
	}
}
