#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:134217728")
using namespace std;
const int N = 5e5 + 100;
int a[N];
int d[(int)1e6 + 100];
int n, k;
pair<int, int> solve() {
  int c = 0;
  int r = 0;
  pair<int, int> ans = make_pair(0, 0);
  for (int l = 0; l < n; l++) {
    while (r < n) {
      if (c == k && d[a[r]] == 0) break;
      d[a[r]]++;
      if (d[a[r]] == 1) c++;
      r++;
    }
    if (ans.second - ans.first + 1 < r - l) ans = make_pair(l, r - 1);
    d[a[l]]--;
    if (d[a[l]] == 0) c--;
  }
  return ans;
}
pair<int, int> tupoe() {
  pair<int, int> ans = make_pair(0, 0);
  for (int i = 0; i < n; i++) {
    for (int j = i; j < n; j++) {
      set<int> S;
      for (int k = i; k <= j; k++) S.insert(a[k]);
      if (S.size() <= k) {
        if (ans.second - ans.first < j - i) ans = make_pair(i, j);
      }
    }
  }
  return ans;
}
void gen() {
  n = 14;
  k = 4;
  for (int i = 0; i < n; i++) {
    a[i] = rand() % 6;
  }
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", a + i);
  pair<int, int> ans = solve();
  cout << ans.first + 1 << ' ' << ans.second + 1;
  return 0;
}
