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

public class Main {
    static int MAX_VALUE = 1000006;
    public static  void main(String[] args) {
        InputReader input = new InputReader(System.in);
        int n = input.nextInt();
        int k = input.nextInt();
        int[] a = new int[n + 1];
        int[] cnt = new int[MAX_VALUE];
        int l = 0, r = -1;
        for (int i = 1; i <= n; ++i) a[i] = input.nextInt();
        for (int i = 1, j = 1, cur = 0; i <= n; ++i) {
            ++cnt[a[i]];
            if (cnt[a[i]] == 1) ++cur;
            while (cur > k) {
                --cnt[a[j]];
                if (cnt[a[j]] == 0) --cur;
                ++j;
            }
            if (cur <= k && (r - l < i - j)) {
                l = j; r = i;
            }
        }
        System.out.printf("%d %d\n", l, r);
    }

    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());
        }
    }
}