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
//package com.himanshu.practice.Aug.aug17;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;

/**
 * Created by himanshubhardwaj on 16/08/18.
 */
public class PearlsInARow {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());


        String[] str = br.readLine().split(" ");
        int[] arr = new int[n];
        ArrayList<Segment> segments = new ArrayList<>();
        HashSet<Integer> set = new HashSet<>();

        for (int i = 0; i < n; i++) {
            arr[i] = Integer.parseInt(str[i]);
        }


        int start = 0;

        for (int i = 0; i < n; i++) {
            if (set.isEmpty()) {
                start = i;
            }

            if (set.contains(arr[i])) {
                Segment segment = new Segment(start + 1, i + 1);
                set = new HashSet<>();
                segments.add(segment);
            } else {
                set.add(arr[i]);
            }
        }

        System.out.println((segments.size() == 0) ? -1 : segments.size());
        for (int i = 0; i < segments.size(); i++) {
            if (i == (segments.size() - 1)) {
                System.out.print(segments.get(i).start + " " + n);
            } else {
                System.out.println(segments.get(i));
            }
        }

    }
}

class Segment {
    int start;
    int end;


    public Segment(int start, int end) {
        this.start = start;
        this.end = end;
    }

    public String toString() {
        return start + " " + end;
    }
}