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

public class Solution {

    public static int RIGHT = 0, LEFT = 0;

    public static void main(String[] args) {
        MyScanner sc = new MyScanner();

        int n = sc.nextInt(), k = sc.nextInt();

        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int lo = 1, hi = 100000, left=0, right=0 ;

        while (lo <= hi) {
            int mid = lo + (hi - lo) / 2;
            if (check(a, k, mid)) {
                right = RIGHT;
                left = LEFT;
                lo = mid + 1;
            } else hi = mid - 1;
        }
        System.out.println((left+1) + " " + (right+1));
    }

    public static boolean check(int[] a, int k, int target) {

        RIGHT=0;
        LEFT=0;
        int uniq=0;

        int[] counts = new int[1000001];
        for (int l=0, r=0; r < a.length; r++) {
            if (counts[a[r]] == 0) {
                uniq++;
            }
            counts[a[r]]++;
            if (uniq <= k) {
                if ( (r-l) > (RIGHT-LEFT)) {
                    RIGHT = r;
                    LEFT = l;
                }
            }
            while (uniq > k) {
                counts[a[l]]--;
                if (counts[a[l]] == 0) {
                    uniq--;
                }
                l++;
            }
        }
        if ( (RIGHT - LEFT) + 1 >= target) return true;
        return false;
    }

    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

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

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
}