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.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

/**
 * Created by bandwitch on 1/11/16.
 */
public class LongestKGoodSegment {

    public static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(String s) {
            try {
                br = new BufferedReader(new FileReader(s));
            } catch (FileNotFoundException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
        }

        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String nextToken() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    // TODO Auto-generated catch block
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(nextToken());
        }

        long nextLong() {
            return Long.parseLong(nextToken());
        }

        double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }

    public static void main(String[] args) {

        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int k = sc.nextInt();

        Map<Integer, Integer> map = new HashMap<>();
        int[] ar = new int[n];

        for (int i = 0; i < n; ++i) {
            ar[i] = sc.nextInt();
            if (i < k) {
                if (map.containsKey(ar[i])) {
                    map.put(ar[i], map.get(ar[i]) + 1);
                }
                else {
                    map.put(ar[i], 1);
                }
            }
        }

        int maxLength = k;
        int currentLength = k;
        int lastA = 0;
        int a = 0, b = k - 1;

        for (int j = k; j < n; ++j) {
            if (map.size() != k || map.containsKey(ar[j])) {
                currentLength = currentLength + 1;
                if (currentLength > maxLength) {
                    a = lastA;
                    b = j;
                    maxLength = currentLength;
                }

                if (map.containsKey(ar[j])) {
                    map.put(ar[j], map.get(ar[j]) + 1);
                }
                else {
                    map.put(ar[j], 1);
                }
            }
            else {
                currentLength++;
                int r = 0;
                int start = lastA;
                while (map.size() == k) {
                    if (map.containsKey(ar[start + r])) {
                        map.put(ar[start + r], map.get(ar[start + r]) - 1);
                    }
                    if (map.get(ar[start + r]) == 0)
                        map.remove(ar[start + r]);

                    currentLength--;
                    r++;
                    lastA++;
                }

                map.put(ar[j], 1);
            }
        }


        System.out.println((a + 1) + " " + (b + 1));
    }
}
