#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
const int mxn = 2e5 + 5;
using namespace std;
struct Node{
Node *l, *r;
int sum;
Node(Node* l, Node* r) : l(l), r(r), sum(0){
if(l)sum += l->sum;
if(r)sum += r->sum;
}
Node(int x) : l(nullptr), r(nullptr), sum(x){}
};
Node* build(int l, int r, vi &a){
if(l == r){
return new Node(a[l]);
}
else{
int mid = (l + r) / 2;
return new Node(build(l, mid,a), build(mid + 1, r,a));
}
}
Node* update(Node* v, int tl, int tr, int k, int x){
if(tl == tr){
return new Node(x);
}
else{
int mid = (tl + tr) / 2;
if(mid >= k){
return new Node(update(v->l, tl, mid, k, x), v->r);
}
else return new Node(v->l, update(v->r, mid+1, tr, k, x));
}
}
int quer(Node* v, int tl, int tr, int l, int r){
if(l > r)return 0;
if(tl == l && tr == r)return v->sum;
int mid = (tl + tr) / 2;
return quer(v->l, tl, mid, l, min(r, mid)) + quer(v->r, mid+1, tr, max(l, mid+1), r);
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin(".in");
//ofstream cout(".out");
in2(n,q);
vin(v,n);
vi w(mxn);
w[v[0]] = 1;
vector<Node*>roots;
roots.pb(build(0, mxn-1, w));
FOR(i, 1, n){
w[v[i]]++;
roots.pb(update(roots[i-1], 0, mxn-1, v[i], w[v[i]]));
}
while(q--){
in2(a,b);
a--; b--;
int l = 0;
int r = mxn-1;
while(l < r){
int mid = l + (r - l + 1) / 2;
int x;
if(a != 0)x = quer(roots[a-1], 0, mxn-1, mid, mxn-1);
else x = 0;
int y = quer(roots[b], 0, mxn-1, mid, mxn-1);
if(y - x >= mid){
l = mid;
}
else{
r = mid - 1;
}
}
out(l);
}
}
