Problem: 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

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class D {
    public static void main(String[] args) {

        QuickScanner in = new QuickScanner(System.in);

        int n = in.nextInt();
        int k = in.nextInt();

        int[] a = new int[n];

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

        int l = 0;
        int r = 0;
        int good_size = 0;
        HashMap<Integer, Integer> count = new HashMap<Integer, Integer>();
        int max_l = 0;
        int max_r = 0;
        while (r < n)
        {
            while (l < r && good_size > k)  if (decr(a[l++], count)) good_size--;
            while (r < n && good_size <= k)
            {
                if (incr(a[r], count)) good_size++;
                r++;
                if (good_size <= k && r - l > max_r - max_l)
                {
                    max_r = r; max_l = l;
                }
            }
        }
        System.out.println((max_l+1) + " " + (max_r));
    }

    public static boolean incr(int val, HashMap<Integer, Integer> map)
    {
        int new_count;
        if (!map.containsKey(val))
            new_count = 1;
        else
            new_count = map.get(val)+1;
        map.put(val, new_count);
        return new_count == 1;
    }

    public static boolean decr(int val, HashMap<Integer, Integer> map)
    {
        int new_count = map.get(val)-1;
        map.put(val, new_count);
        return new_count == 0;
    }
}



































class QuickScanner {
    BufferedReader in;
    StringTokenizer token;
    String delim;
    public QuickScanner(InputStream inputStream)
    {
        this.in=new BufferedReader(new InputStreamReader(inputStream));
        this.delim=" \n\t";
        this.token=new StringTokenizer("",delim);
    }

    public boolean hasNext()
    {
        while(!token.hasMoreTokens())
        {
            try {
                String s=in.readLine();
                if(s==null) return false;
                token=new StringTokenizer(s,delim);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
        }
        return true;
    }

    public String next()
    {
        hasNext();
        return token.nextToken();
    }

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

}