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
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Vaibhav Pulastya
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CPearlsInARow solver = new CPearlsInARow();
        solver.solve(1, in, out);
        out.close();
    }

    static class CPearlsInARow {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            HashMap<Integer, Integer> lastseen = new HashMap<>(2 * n);
            int[] bef = new int[n];
            int[] a = in.nextIntArray(n);
            Arrays.fill(bef, -1);
            for (int i = 0; i < n; i++) {
                if (!lastseen.containsKey(--a[i])) {
                    lastseen.put(a[i], i);
                } else {
                    bef[i] = lastseen.get(a[i]);
                    lastseen.put(a[i], i);
                }
            }

            ArrayList<Integer> ansL = new ArrayList<>();
            ArrayList<Integer> ansR = new ArrayList<>();
            ansL.add(0);
            for (int i = 0; i < n; i++) {
                if (bef[i] == -1) continue;
                if (bef[i] < ansL.get(ansL.size() - 1)) continue;
                ansR.add(i);
                if (i + 1 != n) ansL.add(i + 1);
            }
            if (ansL.size() == 1 && ansL.size() != ansR.size()) {
                out.println(-1);
            } else if (ansL.size() == ansR.size()) {
                out.println(ansL.size());
                for (int i = 0; i < ansL.size(); i++) {
                    out.println((ansL.get(i) + 1) + " " + (ansR.get(i) + 1));
                }
            } else {
                ansL.remove(ansL.size() - 1);
                ansR.remove(ansR.size() - 1);
                ansR.add(n - 1);
                out.println(ansL.size());
                for (int i = 0; i < ansL.size(); i++) {
                    out.println((ansL.get(i) + 1) + " " + (ansR.get(i) + 1));
                }
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int[] nextIntArray(int size) {
            int[] array = new int[size];
            for (int i = 0; i < size; i++)
                array[i] = nextInt();
            return array;
        }

    }
}

