#include <bits/stdc++.h>
using namespace std;
const int MAX_N = (int)3e5 + 10;
int N;
int Ans[MAX_N][2], AnsP;
map<int, int> M;
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    int x;
    scanf("%d", &x);
    if (M.find(x) == M.end()) {
      M[x] = i;
    } else {
      AnsP++;
      Ans[AnsP][0] = M[x];
      Ans[AnsP][1] = i;
      M.clear();
    }
  }
  if (AnsP == 0)
    printf("-1");
  else
    printf("%d", AnsP);
  Ans[0][1] = 0;
  for (int i = 1; i <= AnsP; i++) {
    if (Ans[i][1] != N && i == AnsP) Ans[i][1] = N;
    printf("\n%d %d", Ans[i - 1][1] + 1, Ans[i][1]);
  }
  return 0;
}
