#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n, k;
int a[N];
int c[1000000 + 10];
vector<pair<int, int> > ans;
int num;
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  int l = 0, r = 0;
  num = 0;
  for (l = 0; l < n; ++l) {
    if (l)
      while (num >= k) {
        c[a[l - 1]]--;
        if (c[a[l - 1]] == 0) num--;
        if (num < k) break;
        l++;
      }
    while ((r < n) && (num < k + 1)) {
      if (c[a[r]] == 0) num++;
      c[a[r]]++;
      r++;
    }
    if (r == n) {
      if (num == k + 1) ans.push_back(make_pair(l, r - 2));
      if (num < k + 1) ans.push_back(make_pair(l, r - 1));
      break;
    }
    r--;
    c[a[r]]--;
    num--;
    ans.push_back(make_pair(l, r - 1));
  }
  pair<int, int> last;
  last = ans[0];
  for (int i = 1; i < ans.size(); ++i)
    if ((last.second - last.first) < (ans[i].second - ans[i].first))
      last = ans[i];
  cout << last.first + 1 << " " << last.second + 1;
}
