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

def proceed_items(items):
    result = -1

    current_items = set()
    in_subset_now = False
    current_subset_start = 1
    subsets = []

    for position, item in enumerate(items):
        if not in_subset_now:
            in_subset_now = True
            current_items.clear()
            current_items.add(item)
            current_subset_start = position + 1

        elif item in current_items:
            in_subset_now = False
            subset = [current_subset_start, position + 1]
            subsets.append(subset)

        else:
            current_items.add(item)

    if subsets:
        # Force last subset to cover rest of the items
        last_subset = subsets[-1]
        last_subset[-1] = len(items)

        print len(subsets)
        for start, finish in subsets:
            print '{0} {1}'.format(start, finish)

        return

    print result


if __name__ == '__main__':
    raw_input()  # Skip number of items

    user_input = raw_input()
    parsed_input = user_input.split()
    parsed_input = map(int, parsed_input)

    proceed_items(parsed_input)
