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;
long long a[500001], mp[1000001];
int main() {
  ios_base::sync_with_stdio(0);
  long long n, k, i, j;
  cin >> n >> k;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  long long l = 0, r = n;
  while (l + 1 < r) {
    long long bm = (l + r) / 2, kol = 0, f = 0;
    for (i = 1; i <= bm; i++) {
      if (mp[a[i]] == 0) kol++;
      mp[a[i]]++;
    }
    if (kol <= k) f = 1;
    for (; i <= n; i++) {
      mp[a[i - bm]]--;
      if (mp[a[i - bm]] == 0) kol--;
      if (mp[a[i]] == 0) kol++;
      mp[a[i]]++;
      if (kol <= k) f = 1;
    }
    for (i = n; i > n - bm - 1; i--) mp[a[i]] = 0;
    if (f == 1)
      l = bm;
    else
      r = bm;
  }
  long long bm = r, kol = 0, f = 0;
  for (i = 1; i <= bm; i++) {
    if (mp[a[i]] == 0) kol++;
    mp[a[i]]++;
  }
  if (kol <= k) {
    cout << i - bm << " " << i - 1;
    return 0;
  }
  for (; i <= n; i++) {
    mp[a[i - bm]]--;
    if (mp[a[i - bm]] == 0) kol--;
    if (mp[a[i]] == 0) kol++;
    mp[a[i]]++;
    if (kol <= k) {
      cout << i - bm + 1 << " " << i;
      return 0;
    }
  }
  for (i = n; i > n - bm - 1; i--) mp[a[i]] = 0;
  bm = l, kol = 0, f = 0;
  for (i = 1; i <= bm; i++) {
    if (mp[a[i]] == 0) kol++;
    mp[a[i]]++;
  }
  if (kol <= k) {
    cout << i - bm << " " << i - 1;
    return 0;
  }
  for (; i <= n; i++) {
    mp[a[i - bm]]--;
    if (mp[a[i - bm]] == 0) kol--;
    if (mp[a[i]] == 0) kol++;
    mp[a[i]]++;
    if (kol <= k) {
      cout << i - bm + 1 << " " << i;
      return 0;
    }
  }
  return 0;
}
