#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T, N;
cin >> T >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
const int INF = 1e9;
vector<int> first(T, INF), last(T, -1);
for (int i = 0; i < N; i++) {
first[a[i]] = min(first[a[i]], i);
last[a[i]] = max(last[a[i]], i);
}
int l = N, r = -1;
for (int i = 0; i < T; i++) {
if (first[i] < last[i]) {
l = min(l, first[i]);
r = max(r, last[i]);
}
}
if (r == -1) {
cout << 0 << " " << 0 << "\n";
return 0;
}
bool changed = true;
while (changed) {
changed = false;
for (int i = 0; i < T; i++) {
if (first[i] < l && last[i] > r) {
l = min(l, first[i]);
r = max(r, last[i]);
changed = true;
}
}
}
cout << l << " " << r << "\n";
return 0;
}
