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.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.ArrayList;

public class Main
{

    private static Reader reader;

    public static void main(String[] args)
    throws IOException
    {
        reader = new Reader();

		reader.readLine();
		int n = reader.readInt(0);
		int k = reader.readInt(1);
		int []freq = new int[1000005];
		int []vals = new int[n];

		int st,max,count,curEd,curCount;
		st = max = count = curCount = curEd = 0;

		reader.readLine();
		for (int i=0;i < n;++i)
		{
			int v = reader.readInt(i);
			vals[i] = v;

			if (freq[v] == 0)
				++count;

			++freq[v];
			++curCount;

			if (count > k)
			{
				if (curCount - 1 > max)
				{
					
					max = curCount - 1;
					curEd = i - 1;
				}

				while (true)
				{
					--freq[vals[st]];
					--curCount;
					if (freq[vals[st]] == 0)
					{
						--count;
						++st;
						break;
					}
					++st;
				}
			}
			else
			if (curCount > max)
			{
				max = curCount;
				curEd = i;
			}

		}

		++curEd;
		--max;
		System.out.println(curEd-max+" "+curEd);
		
		reader.close();
    }
}

class Pair implements Comparable<Pair>
{
    int f,s;

    public Pair(int f, int s)
    {
        this.f = f;
        this.s = s;
    }

    @Override
    public int compareTo(Pair p1)
    {
        // TODO: Implement this method

        if (f != p1.f)
            return p1.s - s;
        return p1.f - f;

    }
}

class Reader
{
    private BufferedReader reader;
    private String line[];

    public Reader()
    {
        reader = new BufferedReader(
            new InputStreamReader(System.in));
    }

    public void readLine()
    throws IOException
    {
        line = reader.readLine().split(" ");
    }

    public int readInt(int pos)
    throws IOException
    {
        return Integer.parseInt(line[pos]);
    }

    public double readDouble(int pos)
    throws IOException
    {
        return Double.parseDouble(line[pos]);
    }

    public long readLong(int pos)
    throws IOException
    {
        return Long.parseLong(line[pos]);
    }

    public String readString(int pos)
    throws IOException
    {
        return line[pos];
    }

    public void close()
    throws IOException
    {
        reader.close();
    }
}