#include<bits/stdc++.h>
using namespace std;
int cnt[1000005],m,ii[10123456];
queue<int>q;
int bol()
{
	for(int j=1;j<=m;j++)
	{
		if(cnt[j]==0)return 0;
	}
	return 1;
}
int main() 
{
	int n,k=0,s=0;
	cin>>n>>m;
	for(int i=0;i<n;i++)
	{
		int a;
		cin>>a;
		if(ii[a]==0)ii[a]=++s;
		if(q.front()==a)q.pop(),q.push(a),k++;
		else q.push(a),cnt[ii[a]]=1;
		if(bol())break;
	}
	cout<<k+1<<' '<<k+q.size();
	return 0;
}