#include <bits/stdc++.h>
using namespace std;
int cnt[1000100], a[1000100];
int main() {
  int n, k, ans;
  scanf("%d", &n);
  scanf("%d", &k);
  for (long long i = 0; i < n; i++) scanf("%d", &a[i]);
  int l = 0, r = 0, al, ar, x;
  cnt[a[0]]++;
  x = 1;
  ans = 1;
  al = 0, ar = 0;
  while (l < n && r < n) {
    r++;
    if (cnt[a[r]] == 0) x++;
    cnt[a[r]]++;
    while (x > k && l <= r) {
      cnt[a[l]]--;
      if (cnt[a[l]] == 0) x--;
      l++;
    }
    r = max(l, r);
    if (r >= n) break;
    if (r - l + 1 > ans) {
      al = l;
      ar = r;
      ans = r - l + 1;
    }
  }
  printf("%d %d\n", al + 1, ar + 1);
  return 0;
}
