#include <bits/stdc++.h>
using namespace std;
void io() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
long long int a[100001], n, k, pos = 1000000000000000;
map<long long int, long long int> m;
set<long long int> s;
int main() {
  cin >> n >> k;
  s.clear();
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    if (s.size() < k) m[a[i]]++;
    s.insert(a[i]);
    if (s.size() == k) pos = min(pos, i);
  }
  if (pos == 1000000000000000) {
    cout << -1 << ' ' << -1 << endl;
    return 0;
  }
  for (long long int i = 0; i < pos + 1; i++) {
    m[a[i]]--;
    if (m[a[i]] == 0) {
      cout << i + 1 << ' ' << pos + 1 << endl;
      return 0;
    }
  }
  return 0;
}
