#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#define SZ(x) int(x.size())
#define FR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
using namespace std;
//gift boxes
const LL MAXN=5e5+5;
LL a[MAXN], f[MAXN], l[MAXN]; //first occ, last occ
bool isl[MAXN];
signed main(){
FAST;
LL t,n; cin>>t>>n;
FR(i,1,n+1){
cin>>a[i];
if (f[a[i]]==0) f[a[i]]=i;
l[a[i]]=i;
}
FOR(i,t) isl[l[i]]=true;
LL id1=0, id2=0;
for (int i=n; i>=1; i--){
if (isl[i]) id2=i;
else break;
}
LL cur=id2;
FR(i,1,n+1){
LL idx=a[i];
if (f[idx]!=i) break;
LL tmp=max(cur,l[idx]+1);
if (tmp-i<id2-id1){
id1=i;
id2=tmp;
}
cur=tmp;
}
cout<<id1<<" "<<id2-2;
return 0;
}
