#include <bits/stdc++.h>
using namespace std;
int a[5005554];
int v[1000009];
int k, n, c, mx, ii, jj, p1, p2;
int d() {
  if (c <= k) return false;
  v[a[p1]]--;
  if (v[a[p1]] == 0) {
    c--;
  }
  p1++;
  return c > k;
}
void p() {
  p2++;
  v[a[p2]]++;
  if (v[a[p2]] == 1) {
    c++;
    while (d())
      ;
  }
  if (p2 - p1 > mx) {
    mx = p2 - p1;
    ii = p1;
    jj = p2;
  }
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  ii = 1;
  jj = n;
  mx = -1;
  c = 0;
  p1 = 0;
  p2 = -1;
  while (p2 < n - 1) p();
  cout << ii + 1 << " " << jj + 1;
  return 0;
}
