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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.HashMap;
import java.util.Scanner;

public class D {

    static void solve() throws IOException {
        int n = nextInt();
        int k = nextInt();
        HashMap<Integer, Integer> set = new HashMap<>();
        int[] a = new int[n];
        for ( int i = 0; i < n; i ++ ) {
            a[i] = nextInt();
        }
        int max = 0;
        int from = 0;
        int to = -1;
        for ( int i = 0, r = 0; i < n; i ++ ) {
            while ( set.size() <= k && r <= n ) {
                if ( r - i > max ) {
                    max = r - i;
                    from = i;
                    to = r - 1;
                }
                if ( r == n ) break;
                if ( set.containsKey( a[r] ) ) {
                    set.put( a[r], set.get( a[r] ) + 1 );
                } else {
                    set.put( a[r], 1 );
                }
                r ++;
            }
            if ( set.get( a[i] ) == 1 ) {
                set.remove( a[i] );
            } else {
                set.put( a[i], set.get( a[i] ) - 1 );
            }
        }
        out.println( ( from + 1 ) + " " + ( to + 1 ) );
    }

    static StreamTokenizer in;
    static PrintWriter out;

    static int nextInt() throws IOException {
        in.nextToken();
        return ( int ) in.nval;
    }

    public static void main( String[] args ) throws IOException {
        in = new StreamTokenizer( new InputStreamReader( System.in ) );
        out = new PrintWriter( System.out );
        solve();
        out.close();
    }
}
