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.*;
import java.util.ArrayDeque;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

@SuppressWarnings("WeakerAccess")
public class Main {

    final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");

    public static void main(String[] args) {
        new Main().run();
    }

    void init() throws FileNotFoundException {
        if (ONLINE_JUDGE) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");
        }
    }

    String readString() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());

        }
        return tok.nextToken();
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }

    public void run() {
        try {
            long t1 = System.currentTimeMillis();
            init();
            solve();
            out.close();
            long t2 = System.currentTimeMillis();
            System.err.println("Time = " + (t2 - t1));
        } catch (Exception e) {
            e.printStackTrace(System.err);
            System.exit(-1);
        }
    }


    public static final class Point implements Comparable<Point> {
        final int x;
        final int y;

        public Point(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(Point o) {
            int compare = Integer.compare(x, o.x);
            if (compare == 0) {
                return Integer.compare(y, o.y);
            }
            return compare;
        }

        @Override
        public String toString() {
            return x + " " + y;
        }
    }

    public void solve() throws IOException {

        int n = readInt();
        int k = readInt();

        ArrayDeque<Point> deq = new ArrayDeque<>();
        Map<Integer, Integer> map = new HashMap<>();

        int l = 0;
        int r = n - 1;
        int ans = Integer.MIN_VALUE;
        for (int i = 0; i < n; i++) {
            int x = readInt();
            deq.add(new Point(x, i));
            map.put(x, map.getOrDefault(x, 0) + 1);
            while (map.keySet().size() > k) {
                Point pop = deq.pop();
                if (map.get(pop.x) == 1) {
                    map.remove(pop.x);
                } else {
                    map.put(pop.x, map.get(pop.x) - 1);
                }
                if (ans < i - 1 - pop.y) {
                    l = pop.y;
                    r = i - 1;
                    ans = r - l;
                }
            }
        }

        if (!deq.isEmpty()) {
            Point pop = deq.pop();
            if (ans < n - 1 - pop.y) {
                l = pop.y;
                r = n - 1;
            }
        }

        out.print((l + 1) + " " + (r + 1));


    }
}