#include<bits/stdc++.h>
//#include<iostream>
//#include<queue>
//#include<stack>
using namespace std;
#define LL long long
int a[1000005];
int b[1000005];
int q[1000005];
int n,m,s=0,head=1,tail=0,mhead=0,mtail=0,tait=0;
int minn=INT_MAX;
int main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		s+=i;
	}
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n;i++){
		tait++;
		tail++;
		q[tail]=a[i];
		if(q[tait]==q[head]&&i!=1){
			head++;
			tait=0;
		}
		for(int j=head;j<=tail;j++){
			b[q[j]]=1;
		} 
		int p=s;
		for(int j=1;j<=m;j++){
			if(b[j]==1){
				b[j]=0;
				p-=j;
			}
		}
		if(p==0){
			if(minn>tail-head+1){
				mtail=tail;
				mhead=head;
				minn=tail-head+1;
			}
		}
	}
	cout<<mhead<<" "<<mtail;
	return 0;
}