#include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
#define ii pair<ll,ll>
#define pll pair<ll,ll>
#define vi vector<int>
#define vii vector<ii>
#define vll vector<ll>
#define vpll vector<pll>
#define matrix vector<vi>
#define matrixLL vector<vLL>
#define vs vector<string>
#define vui vector<ui>
#define msi multiset<int>
#define mss multiset<string>
#define si set<int>
#define ss set<string>
#define PB push_back
#define PF push_front
#define PPB pop_back
#define PPF pop_front
#define X first
#define Y second
#define MP make_pair
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dxx[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dyy[] = {0, 0, -1, 1, -1, 1, -1, 1};
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ld pi = 3.14159265;
const int mod = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 7;
const int inf = mod;
const ll INF = 1e18;
const ll zero = ll(0);
const int logo = 20;
const int off = 1 << logo;
const int trsz = off << 1;
int L[MAXN], R[MAXN];
int ans[MAXN];
int n, q;
vi val[MAXN];
int fenw[MAXN];
void update(int x, int val){
for(; x < MAXN; x += (x & -x)) fenw[x] += val;
}
int query(int x){
int ret = 0;
for(; x; x-= (x & -x)) ret += fenw[x];
return ret;
}
void rek(int lo, int hi, vi a){
if(a.empty()) return;
if(lo > hi) return;
if(lo == hi){
for(auto &x : val[lo]) update(x, 1);
for(auto &x : a){
int lef = L[x], rig = R[x];
if(query(rig) - query(lef - 1) >= lo) ans[x] = lo;
}
for(auto &x : val[lo]) update(x, -1);
return;
}
int mid = (lo + hi) / 2;
for(int i=mid; i<=hi; i++) for(auto &x: val[i]) update(x, 1);
vi lef, rig;
for(auto &x : a){
int le = L[x], ri = R[x];
if(query(ri) - query(le - 1) >= mid) ans[x] = mid, rig.PB(x);
else lef.PB(x);
}
a.clear();
rek(lo, mid-1, lef);
for(int i=mid; i<=hi; i++) for(auto &x: val[i]) update(x, -1);
rek(mid + 1, hi, rig);
}
void solve(){
cin >> n >> q;
for(int i=1, x; i<=n; i++) cin >> x, val[x].PB(i);
vi a;
for(int i=1; i<=q; i++) cin >> L[i] >> R[i], a.PB(i);
rek(1, 200000, a);
for(int i=1; i<=q; i++) cout << ans[i] << "\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
//cin >> t;
while(t--)solve();
return 0;
}
