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;
map<long long, long long> ar;
map<long long, long long> global;
int main() {
  long long a, i, p, seg, ma = 0, l = 1, r = 1, ch = 0;
  cin >> a >> seg;
  for (i = 1; i <= a; i++) {
    scanf("%lld", &p);
    ar[i] = p;
  }
  long long left = 1, co = 0;
  for (i = 1; i <= a; i++) {
    if (a == 1 || i > a) break;
    p = ar[i];
    global[p]++;
    if (global[p] == 1) co++;
    long long p = global[ar[i + 1]];
    if (p + 1 == 1 && co + 1 > seg) {
      if ((i - left) + 1 > ma) {
        ma = (i - left) + 1;
        ch = 1;
        l = left;
        r = i;
      }
      while (1) {
        p = ar[left];
        global[p]--;
        left++;
        if (global[p] == 0) break;
      }
    }
  }
  if (i > a) i = i - 1;
  if ((i - left) + 1 > ma && co == seg) {
    l = left;
    r = i;
    ma = (i - left) + 1;
    ch = 1;
  }
  if (a == 1 && seg == 1) {
    cout << 1 << " " << 1 << "\n";
  } else if (ch == 1) {
    cout << l << " " << r << "\n";
  } else
    cout << 1 << " " << a << "\n";
}
