#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
int n, k, qu;
ll ans[100010];
int p[100010];
map <int,int> M;
set <ll> S;
struct qua{
qua(){}
qua(int s,int d):s(s),d(d){}
int s, d, c;
bool operator<(const qua &l)const{
return d/k != l.d/k ? d/k < l.d/k : s < l.s;
}
}q[100010];
int main()
{
scanf("%d%d",&n,&qu);
k = int(sqrt(n));
int i;
for(i=1;i<=n;i++)scanf("%d",p+i);
for(i=0;i<qu;i++)scanf("%d%d",&q[i].s,&q[i].d), q[i].c = i;
/*
sort(q, q+qu);
int L = 1, R = 0;
for(i=0;i<qu;i++){
while(L>q[i].s)S.insert(++M[p[--L]] * (ll)p[L]);
while(R<q[i].d)S.insert(++M[p[++R]] * (ll)p[R]);
while(L<q[i].s)S.erase(M[p[L]]-- * (ll)p[L++]);
while(R>q[i].d)S.erase(M[p[R]]-- * (ll)p[R--]);
ans[q[i].c] = *(--S.end());
}
*/
for(i=0;i<qu;i++){
ll a = 0;
M.clear();
for(int j=q[i].s;j<=q[i].d;j++)M[p[j]]++;
map <int,int>::iterator it;
for(it = M.begin();it!=M.end();++it)a = max(a, (ll)it->first * it->second);
printf("%lld\n",a);
}
// for(i=0;i<qu;i++)printf("%lld\n",ans[i]);
return 0;
}
