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
#include <bits/stdc++.h>
using namespace std;
const int mycount = 500005;
int thesum = 0;
int total = 0;
int a[mycount];
map<int, int> pool;
int n, m;
int v;
void process() {
  int i, j, k, t, ret = 0;
  int start, end;
  int top = 0;
  map<int, int> pool;
  int cur = 0;
  start = -1;
  int s;
  int c = 0;
  for (i = 1; i <= m; i++) {
    if (pool.find(a[i]) == pool.end()) {
      pool[a[i]] = 1;
      cur++;
      c++;
      if (start == -1) {
        start = i;
      }
    } else {
      c++;
      pool[a[i]]++;
    }
    if (cur > n) {
      if (c - 1 > ret) {
        ret = c - 1;
        s = start;
        end = i - 1;
      }
      while (cur > n) {
        pool[a[start]]--;
        if (pool[a[start]] == 0) {
          cur--;
          pool.erase(a[start]);
        }
        start++;
        c--;
      }
    }
  }
  if (m - start + 1 > ret) {
    s = start;
    end = m;
  }
  printf("%d %d\n", s, end);
}
void input() {
  scanf("%d %d", &m, &n);
  for (int i = 1; i <= m; i++) {
    scanf("%d", &a[i]);
  }
}
int main() {
  input();
  process();
  return 0;
}
