#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " |       ";
  __f(comma + 1, args...);
}
void FastIO() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cout.precision(15);
}
long long modpow(long long a, long long p, long long mod) {
  long long ret = 1;
  while (p) {
    if (p & 1) ret = (ret * a) % mod;
    a = (a * a) % mod;
    p /= 2;
  }
  return ret % mod;
}
long long power(long long a, long long p) {
  long long ret = 1;
  while (p) {
    if (p & 1) ret = (ret * a);
    a = (a * a);
    p /= 2;
  }
  return ret;
}
vector<pair<int, int> > vec;
int a[300010];
int main() {
  FastIO();
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  int i = 0, ans = 0;
  while (i < n) {
    map<int, int> cnt;
    int j = i;
    while (j < n) {
      if (cnt[a[j]] == 1) break;
      cnt[a[j]]++;
      j++;
    }
    if (j != n) {
      ans++;
      vec.push_back(make_pair(i, j));
    }
    i = j + 1;
  }
  if (ans == 0) {
    cout << -1 << '\n';
    return 0;
  }
  cout << ans << '\n';
  for (int i = 0; i < (int)(vec.size()) - 1; i++)
    cout << vec[i].first + 1 << " " << vec[i].second + 1 << '\n';
  cout << vec[(int)(vec.size()) - 1].first + 1 << " " << n << '\n';
  return 0;
}
