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.ArrayList;

public class Practice
{
    public static void main(String[] args) throws IOException
    {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] s = reader.readLine().split(" ");
        int n = Integer.parseInt(s[0]);
        int k = Integer.parseInt(s[1]);
        s = reader.readLine().split(" ");
        int[] a = new int[s.length + 1];
        for(int i = 1; i < a.length; i++) a[i] = Integer.parseInt(s[i - 1]);
        
        int l = -1;
        int r = -1;
        int kGood = 0;
        int tail = 1;
        int max = Integer.MIN_VALUE;
        int[] count = new int[1000001];
        for(int i = 1; i < a.length; i++)
        {
            count[a[i]]++;
            if(count[a[i]] == 1) kGood++;
            
            while(kGood > k)
            {
                count[a[tail]]--;
                if(count[a[tail]] == 0) kGood--;
                tail++;
            }
            
            if(i - tail > max)
            {
                l = tail;
                r = i;
                max = i - tail;
            } 
        }
        
        System.out.println(l + " " + r);
        
        
    }
}