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
// Get the row with the highest min element!

import java.util.*;
import java.io.*;

public class Solution {
    
    public static class Segment {
        int left, right;
        public Segment() {}
        public Segment(int l, int r) {
            this.left = l;
            this.right = r;
        }
    }

    static Segment findSegment(int length, int k) {
        int[] counts = new int[1000001];
        //HashMap<Integer, Integer> counts = new HashMap<Integer, Integer>();
        int distinctCount = 0;
        for (int i = 0; i < items.length; ++i) {
            
            if (i >= length) {
                int left = items[i - length];
                --counts[left];
                //counts.put(items[i - length], counts.get(items[i - length]) - 1);
                if (counts[left] == 0) { //counts.get(items[i - length]) == 0) {
                    //counts.remove(items[i - length]);
                    --distinctCount;
                }
            }

            if (counts[items[i]] == 0) {
                ++distinctCount;
            }
            ++counts[items[i]];

            if (i >= length - 1) {
                if (distinctCount <= k) {
                    return new Segment(i - (length - 1) + 1 , i + 1);
                }
            }
        }
        return null;
    }
    
    static int[] items;

public static void main(String[] args) {
    MyScanner sc = new MyScanner();
    out = new PrintWriter(new BufferedOutputStream(System.out));

    int n = sc.nextInt();
    int k = sc.nextInt();
    
    items = new int[n];
    for (int i = 0; i < n; ++i) {
        items[i] = sc.nextInt();
    }
    
    int l = 1;
    int r = n;
    Segment lastSegment = new Segment();
    while (l <= r) {
        int mid = (l + r) / 2;
        Segment s = findSegment(mid, k);
        if (s == null) {
            r = mid - 1;
        } else {
            lastSegment = s;
            l = mid + 1;
        }
    }
    out.println(lastSegment.left + " " + lastSegment.right);
    out.close();
}

   public static PrintWriter out;

 //-----------MyScanner class for faster input----------
   public static class MyScanner {
      BufferedReader br;
      StringTokenizer st;
 
      public MyScanner() {
         br = new BufferedReader(new InputStreamReader(System.in));
      }
 
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
 
      int nextInt() {
          return Integer.parseInt(next());
      }
 
      long nextLong() {
          return Long.parseLong(next());
      }
 
      double nextDouble() {
          return Double.parseDouble(next());
      }
 
      String nextLine() {
          String str = "";
	  try {
	     str = br.readLine();
	  } catch (IOException e) {
	     e.printStackTrace();
	  }
	  return str;
      }
   }
   //--------------------------------------------------------
}
