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.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.StringTokenizer;


public class C {
	void solve(InputReader in, PrintWriter out) {
		int N = in.nextInt();
		Map<Long, Integer> numPos = new HashMap<Long, Integer>();
		int left = 1;
		StringBuilder res = new StringBuilder();
		List<Integer> s = new ArrayList<Integer>(), e = new ArrayList<Integer>();
		
		for(int i = 1; i <= N; i++) {
			long num = in.nextLong();
			int pos = numPos.getOrDefault(num, -1);
			if(pos >= left) {
//				res.append(left + " " + i + "\n");
				s.add(left);
				e.add(i);
				left = i + 1;
			}
			else {
				numPos.put(num, i);
			}
		}
		if(s.isEmpty()) {
			out.print("-1");
		}
		else {
			if(left < N + 1) {
				e.remove(e.size() - 1);
				e.add(N);
			}
			out.println(s.size());
			for(int i = 0; i < s.size(); i++) {
				res.append(s.get(i) + " " + e.get(i) + "\n");
			}
			out.print(res.toString());
		}
	}

	public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);

        C a = new C();
        a.solve(in, out);
        
        out.close();
	}

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        
        public long nextLong() {
        	return Long.parseLong(next());
        }

        public long nextDouble() {
        	return Long.parseLong(next());
        }
        
    }
}
