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.FileNotFoundException;
import java.io.FileReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.Set;
import java.util.HashSet;
import java.util.List;
import java.util.ArrayList;

public class Main {

    public static void main(String[] args) {
        
        InputReader reader = new InputReader();
        Set<Integer> set = new HashSet<Integer>();
        List<Pair> list = new ArrayList<Pair>();

        int n = reader.nextInt();
        int[] arr = new int[n];
        for(int i = 0; i < n; i++) {
            arr[i] = reader.nextInt();
        }

        int answer = 0;
        int left = 0;
        for(int i = 0; i < n; i++) {
            if(set.contains(arr[i])) {
                ++answer;
                list.add(new Pair(left + 1, i + 1));
                left = i + 1;
                set.clear();
            } else {
                set.add(arr[i]);
            }
        }
        if (answer == 0) {
            System.out.println("-1");
        } else {
            if (left != n ) {
                Pair last = list.get(list.size() - 1);
                last.setRight(n);
                
            } 

            System.out.println(list.size());
            for(int i = 0; i < list.size(); i++) {
                System.out.println(list.get(i).getLeft() + " " + list.get(i).getRight());
            }
         
        }
    }

}
class Pair {

    private int left;
    private int right;

    public Pair(int left, int right) {
        this.left = left;
        this.right = right;
    }
    public void setLeft(int left) {
        this.left = left;
    }  
    public void setRight(int right) {
        this.right = right;
    }
    public int getLeft() {
        return left;
    }

    public int getRight() {
        return right; 
    }

}




class InputReader{
 private BufferedReader reader;
 private StringTokenizer tokenizer;

 public InputReader() {
     tokenizer = null;
     reader = new BufferedReader(new InputStreamReader(System.in));
 }

 public InputReader(String fileName) throws FileNotFoundException{
     tokenizer = null;
     reader = new BufferedReader(new FileReader(fileName));
 }

 public String nextLine() throws IOException{
     return reader.readLine();
 }

 public String next() {
     while ( tokenizer == null || !tokenizer.hasMoreTokens() ) {
         try {
             tokenizer = new StringTokenizer(nextLine());
         } catch( IOException e) {
             throw new RuntimeException(e);
         }
     }
     return tokenizer.nextToken();
 }

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

 public double nextDouble() {
     return Double.parseDouble(next());
 }

 public long nextLong() {
     return Long.parseLong(next());
 }
}