#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void CHECK();
void setio(){
freopen("/Users/iantsai/cpp/input.txt","r",stdin);
freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 1e5 + 5;
int v[mxn], id[mxn], cnt[mxn], cnt2[mxn], an;
vector<int>tmp;
void solve(){
int n, q;
cin >> n >> q;
for(int i = 1; i <= n; i++){
cin >> v[i];
tmp.pb(v[i]);
}
sort(all(tmp));
tmp.resize(unique(all(tmp)) - tmp.begin());
for(int i = 1; i <= n; i++){
id[i] = lower_bound(all(tmp), v[i]) - tmp.begin();
}
int nl = 1, nr = 1;
vector<array<int, 3>>qry;
for(int i = 0; i < q; i++){
int l, r;
cin >> l >> r;
qry.pb({l, r, i});
}
const int B = sqrt(n) / 2;
sort(all(qry), [&](array<int, 3>a, array<int, 3>b){
int ba = a[0] / B, bb = b[0] / B;
if(ba != bb) return ba < bb;
return a[1] < b[1];
});
vector<int>ans(q);
int lb = -1;
cnt[id[1]]++;
for(auto [l, r, idx] : qry){
int bl = l / B, br = r / B;
if(bl == br){
for(int i = l; i <= r; i++){
cnt2[id[i]]++;
chmax(ans[idx], cnt2[id[i]] * v[i]);
}
for(int i = l; i <= r; i++){
cnt2[id[i]]--;
}
continue;
}
if(bl != lb){
int R = min(n, (bl + 1) * B - 1);
while(nr > R){
cnt[id[nr]]--;
nr--;
}
while(nl < R){
cnt[id[nl]]--;
nl++;
}
an = cnt[id[R]] * v[R];
debug(nl, nr, R, an);
lb = bl;
}
int ol = nl;
while(nr < r){
nr++;
cnt[id[nr]]++;
chmax(an, cnt[id[nr]] * v[nr]);
}
int oans = an;
while(nl > l){
nl--;
cnt[id[nl]]++;
chmax(an, cnt[id[nl]] * v[nl]);
}
debug(nl, nr, an, id[4], cnt[id[4]]);
ans[idx] = an;
an = oans;
while(nl < ol){
cnt[id[nl]]--;
nl++;
}
lb = bl;
}
for(int i = 0; i < q; i++){
cout << ans[i] << '\n';
}
}
signed main(){
TOI_is_so_de;
int t = 1;
//cin >> t;
while(t--){
solve();
}
#ifdef local
CHECK();
#endif
}
/*
input:
*/
#ifdef local
void CHECK(){
cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
std::ifstream file1(p1);
std::ifstream file2(p2);
if(!file1.is_open() || !file2.is_open()) return false;
std::string line1, line2;
while (getline(file1, line1) && getline(file2, line2)) {
if (line1 != line2)return false;
}
int cnta = 0, cntb = 0;
while(getline(file1,line1))cnta++;
while(getline(file2,line2))cntb++;
return cntb - cnta <= 1;
};
bool check = compareFiles("output.txt","expected.txt");
if(check) cerr<<"ACCEPTED\n";
else cerr<<"WRONG ANSWER!\n";
}
#else
#endif
