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 {
    public static void main(String[] args) throws IOException{
        //BufferedReader f = new BufferedReader(new FileReader("uva.in"));
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        StringTokenizer st = new StringTokenizer(f.readLine());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        int[] a = new int[n];
        st = new StringTokenizer(f.readLine());
        for(int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(st.nextToken());
        }
        HashMap<Integer, Integer> seen = new HashMap<>();
        int i = 0;
        int j = 0;
        int l = 0;
        int r = -1;
        while(j < n) {
            if(seen.size() <= k) {
                if(j-i > r-l+1) {
                    l = i+1;
                    r = j;
                }
                seen.put(a[j], seen.getOrDefault(a[j], 0)+1);
                j++;
            } else {
                while(seen.size() > k) {
                    seen.put(a[i], seen.get(a[i])-1);
                    if(seen.get(a[i]) == 0) {
                        seen.remove(a[i]);
                    }
                    i++;
                }
            }
        }
        while(seen.size() > k) {
            seen.put(a[i], seen.get(a[i])-1);
            if(seen.get(a[i]) == 0) {
                seen.remove(a[i]);
            }
            i++;
        }
        if(j-i > r-l+1) {
            l = i+1;
            r = j;
        }
        out.println(l + " " + r);
        f.close();
        out.close();
    }
}
