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 codeforces;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 * Created by nitin.s on 23/03/16.
 */
public class LongestKGoodSegment {
    public static void main(String[] args) throws IOException {
        FastScanner in = new FastScanner(System.in);
        int n = in.nextInt(), k = in.nextInt();
        int[] a = new int[n];
        for(int i = 0; i < n; ++i) a[i] = in.nextInt();
        int i = 0, j = 0;
        int answer = 0;
        int curLen = 0;
        int l = 0, r = 0;
        Map<Integer, Integer> mymap = new HashMap<Integer, Integer>();
        mymap.put(a[0], 1);
        answer = 1;
        curLen = 1;
        l = 0;
        r = 0;
        int start, end;
        start = 0;
        end = 0;
        answer = 1;
        r = 1;
        while(r < n) {
            if(mymap.containsKey(a[r])) {
                mymap.put(a[r], mymap.get(a[r]) + 1);
                if(curLen <= k && r - l + 1 > answer) {
                    answer = r - l + 1;
                    start = l;
                    end = r;
                }
            } else {
                ++curLen;
                mymap.put(a[r], 1);
                while(curLen > k && l < r) {
                    int value = mymap.get(a[l]);
                    if(value == 1) {
                        mymap.remove(a[l]);
                        --curLen;
                        ++l;
                        break;
                    } else {
                        mymap.put(a[l], value - 1);
                        ++l;
                    }
                }
            }
            if(curLen <= k && r - l + 1 > answer) {
                answer = r - l + 1;
                start = l;
                end = r;
            }
            ++r;
        }
        if(answer == -1) {
            System.out.println(-1 + " " + -1);
            return;
        }
        System.out.println((start + 1) + " " + (end + 1));
    }

    static class FastScanner
    {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream input)
        {
            br = new BufferedReader(new InputStreamReader(input));
            st = new StringTokenizer("");
        }

        public String next() throws IOException
        {
            if(st.hasMoreTokens())
            {
                return st.nextToken();
            }
            else
            {
                st = new StringTokenizer(br.readLine());
                return next();
            }
        }

        public int nextInt() throws IOException
        {
            return Integer.parseInt(next());
        }
    }
}
