#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, m, a[N], k[N], sum, l, r;
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) 
		scanf("%d", &a[i]);
	while (sum < m) {
		++r;
		++k[a[r]];
		if (k[a[r]] == 1) ++sum;
	} 
	while (sum >= m) {
		++l;
		if (k[a[l]] > 1) --k[a[l]];
		else break;
	}
	cout << l << " " << r;
	return 0;
}