#include<cstdio>
#include<memory.h>
#include<algorithm>
#define BUCKET 250
int a[100000];
int b[100000];
int c[100000];
int d[1000][100000];
long long x[1000][1000];
char ss[2097152];
inline int getnum()
{
int t,r=0;
do{t=getchar();}while(t<40);
do{r=r*10+t-48;t=getchar();}while(t>40);
return r;
}
int main()
{
char *p;
long long r;
int s,e,t;
int i,j,k,n,m;
scanf("%d %d\n",&n,&m);
fgets(ss,2097151,stdin);
p=ss;
for(i=0;i<n;i++)
{
while(*p<40)p++;
while(*p>40)
{
a[i]=a[i]*10+*p-48;
p++;
}
b[i]=a[i];
}
std::sort(b,b+n);
for(i=0;i<n;i++)a[i]=std::lower_bound(b,b+n,a[i])-b;
for(i=0;i<n/BUCKET;i++)
{
if(i>0)memcpy(d[i],d[i-1],n<<2);
for(j=0;j<BUCKET;j++)d[i][a[i*BUCKET+j]]++;
}
for(i=0;i<n/BUCKET;i++)
{
memset(c,0,n<<2);
for(j=i;j<n/BUCKET;j++)
{
if(j>i)x[i][j]=x[i][j-1];
for(k=0;k<BUCKET;k++)
{
t=j*BUCKET+k;
c[a[t]]++;
if(1LL*b[a[t]]*c[a[t]]>x[i][j])x[i][j]=1LL*b[a[t]]*c[a[t]];
}
}
}
memset(c,0,n<<2);
for(i=0;i<m;i++)
{
s=getnum()-1;e=getnum();
if((s+BUCKET-1)/BUCKET<e/BUCKET)
{
r=x[(s+BUCKET-1)/BUCKET][e/BUCKET-1];
for(j=s;j<(s+BUCKET-1)/BUCKET*BUCKET;j++)c[a[j]]++;
for(j=e/BUCKET*BUCKET;j<e;j++)c[a[j]]++;
for(j=s;j<(s+BUCKET-1)/BUCKET*BUCKET;j++)if(1LL*b[a[j]]*(c[a[j]]+d[e/BUCKET-1][a[j]]-((s+BUCKET-1)/BUCKET>0?d[(s+BUCKET-1)/BUCKET-1][a[j]]:0))>r)r=1LL*b[a[j]]*(c[a[j]]+d[e/BUCKET-1][a[j]]-((s+BUCKET-1)/BUCKET>0?d[(s+BUCKET-1)/BUCKET-1][a[j]]:0));
for(j=e/BUCKET*BUCKET;j<e;j++)if(1LL*b[a[j]]*(c[a[j]]+d[e/BUCKET-1][a[j]]-((s+BUCKET-1)/BUCKET>0?d[(s+BUCKET-1)/BUCKET-1][a[j]]:0))>r)r=1LL*b[a[j]]*(c[a[j]]+d[e/BUCKET-1][a[j]]-((s+BUCKET-1)/BUCKET>0?d[(s+BUCKET-1)/BUCKET-1][a[j]]:0));
for(j=s;j<(s+BUCKET-1)/BUCKET*BUCKET;j++)c[a[j]]=0;
for(j=e/BUCKET*BUCKET;j<e;j++)c[a[j]]=0;
}
else
{
r=0;
for(j=s;j<e;j++)c[a[j]]++;
for(j=s;j<e;j++)if(1LL*b[a[j]]*c[a[j]]>r)r=1LL*b[a[j]]*c[a[j]];
for(j=s;j<e;j++)c[a[j]]=0;
}
printf("%lld\n",r);
}
}
