#include <bits/stdc++.h>
using namespace std;
int n,m;
int a[1000006];
int vis[1000006];
int main(){
cin>>n>>m;
for(int i = 1;i<=n;i++){
scanf("%d",&a[i]);
}
int l = 1,r = 2;
int ansl = 114,ansr = 514;
int sum = 0;
vis[a[1]] = 1;
int anss= 0x7f7f7f7f;
int viip = 1;
while(r!=n+1){
bool fll = 0;
if(vis[a[r]]==0)viip++;
vis[a[r]]++;
while(vis[a[r]] >= 1&&a[r] == a[l]){
vis[a[l]]--;
l++;
}
sum = r-l;
if(sum<anss&&viip == m){
anss = sum;
ansl = l;
ansr = r;
}
r++;
}
cout<<ansl<<" "<<ansr;
return 0;
}