#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e2;
map<string, string> maap;
vector<int> circle;
bool vis[N];
int parent[N];
int chk[N];
int color[N];
int tim[2][N];
int dis[N];
int position[N];
vector<int> adj[N];
vector<int> adj1[N];
vector<int> graph[N];
bool has_cycle;
int maxdis, maxnode, Totnode, depth = 1;
bool ok;
queue<int> q;
stack<int> stk;
vector<int> solution;
int indegree[N];
int go[N];
int to[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int t;
  int cas = 0;
  int n, m, i, j, cnt1 = 0, cnt2 = 0, cnt = 0, even = 0, odd = 0, len, k, r, l,
                  z = 0, x = 0, y = 0, flag = 0, sum = 0;
  int a = 0, b = 0, c = 0, d = 0, ans = 0LL, rem, quot, zero = 0, fst = 0,
      null = 0, snd = 0, lst = 0, rone = 0, one = 0, pos = 0, neg = 0,
      mn = INT_MAX, mx = INT_MIN;
  char ch;
  int h1, h2, m1, m2, h;
  int velo1, velo2, ac1, ac2, time;
  int node, edge, u, v, cost;
  int best, worst;
  double nd, ad, bd, xd;
  string str, str1 = "", str2 = "", str3 = "", strstore1 = "", strstore2 = "";
  cin >> n;
  vector<int> vec1(n + 4);
  vector<pair<int, int>> vec;
  map<int, int> mp1;
  lst = 1;
  for (int i = 1; i <= n; i++) {
    cin >> vec1[i];
  }
  for (int i = 1; i <= n; i++) {
    if (mp1[vec1[i]] != 0) {
      vec.push_back(make_pair(lst, i));
      for (int j = lst; j <= i; j++) {
        mp1[vec1[j]] = 0;
      }
      lst = i + 1;
    } else {
      mp1[vec1[i]] = 1;
    }
  }
  if (vec.size() == 0) {
    cout << -1 << endl;
  } else {
    vec.back().second = n;
    cout << vec.size() << endl;
    for (auto it : vec) {
      cout << it.first << " " << it.second << endl;
    }
  }
  return 0;
}
