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.BufferedInputStream;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

import javax.swing.plaf.basic.BasicInternalFrameTitlePane.MaximizeAction;

public class Main {

    int[] a;
    int[] cnt;

    public void solve() {

        Scanner scan = new Scanner(new BufferedInputStream(System.in));

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

        a = new int[n + 1];
        cnt = new int[1000010];

        for (int i = 1; i <= n; i++) {
            a[i] = scan.nextInt();
        }

        int distVal = 0;
        int l = 0;
        int ansl = 0, ansr = -1;
        for (int i = 1; i <= n; i++) {
            if (cnt[a[i]] == 0) {
                distVal++;
            }
            cnt[a[i]]++;
            while (distVal > k) {
                l++;
                if (cnt[a[l]] == 1) {
                    distVal--;
                }
                cnt[a[l]]--;
            }
            if (distVal <= k) {
                if (i - l > ansr - ansl + 1) {
                    ansr = i;
                    ansl = l + 1;
                }
            }
        }
        System.out.printf("%d %d\n", ansl, ansr);
        scan.close();
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        new Main().solve();
    }
}