#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000010];
int cnt[2002];
int main() {
    int n,m;
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        
    }
    int w = 0;
    int l=1,r=0,al=0,ar=n+1;
    while(l+m<n){
        while(w<m&&r<=n){//注意re
            r++;
            if(cnt[a[r]]==0)w++;
            cnt[a[r]]++;
            
            
        }
        if(w==m) if(r-l<ar-al) {ar=r;al=l;}//don't forget 'w==m',to avoid the situation that only r>n,but the w is not accomplished.
        
        cnt[a[l]]--;
        if(cnt[a[l]]==0)w--;
        l++;
        if(r>n)break;
        
    }
    
    printf("%d %d",al,ar);
    return 0;
}