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
// This template code suggested by KT BYTE Computer Science Academy
//   for use in reading and writing files for USACO problems.

// https://content.ktbyte.com/problem.java

import java.util.*;
import java.io.*;

public class LongestKGoodSegment {

    static StreamTokenizer in;

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

    public static void main(String[] args) throws Exception {
        in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

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

        int[] ks = new int[n];

        for (int i = 0; i < n; i++) {
            ks[i] = nextInt();
        }

        int lp = 0;
        int rp = 0;
        HashMap<Integer, Integer> songs = new HashMap<>();

        int result = 0;
        int longLP = 0;
        int longRP = 0;

        while (lp < n) {
            while (rp < n && (songs.containsKey(ks[rp]) || songs.size() < k)) {
                if (songs.containsKey(ks[rp])) {
                    songs.put(ks[rp], songs.get(ks[rp]) + 1);
                }
                else {
                    songs.put(ks[rp], 1);
                }
                rp++;
            }

            if (rp - lp > result) {
                result = rp-lp;
                longLP = lp;
                longRP = rp;
            }

            if (songs.get(ks[lp]) == 1) songs.remove(ks[lp]);
            else songs.put(ks[lp], songs.get(ks[lp]) - 1);
            lp++;
        }

        out.println((longLP+1) + " " + (longRP));

        out.close();
    }
}


