#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;

typedef long long LL;

const int N = 100005, S = 355;

int n, m, a[N], d[N], pos[N], L[S], R[S], len, tot, t, cnt[N], s[N];

LL ans[N], sum;

struct Q{
    int l, r, id;
    bool operator < (const Q &b) const {
        if (pos[l] != pos[b.l]) return pos[l] < pos[b.l];
        return r < b.r;
    }
} q[N];

void del(int x) { cnt[x]--; }
void add(int x) {
    cnt[x]++; sum = max(sum, (LL)d[x] * cnt[x]);
}

int main() {
    scanf("%d%d", &n, &m);
    t = sqrt(n), len = n / t;
    for (int i = 1; i <= len; i++) {
        L[i] = (i - 1) * t + 1, R[i] = i * t;
    }
    if (R[len] < n) R[len] = n;
    for (int i = 1; i <= len; i++)
        for (int j = L[i]; j <= R[i]; j++) pos[j] = i;

    for (int i = 1; i <= n; i++) scanf("%d", a + i), d[i] = a[i];
    sort(d + 1, d + 1 + n);
    tot = unique(d + 1, d + 1 + n) - d - 1;
    for (int i = 1; i <= n; i++) a[i] = lower_bound(d + 1, d + 1 + tot, a[i]) - d;
    for (int i = 1; i <= m; i++)
        scanf("%d%d", &q[i].l, &q[i].r), q[i].id = i;
    sort(q + 1, q + 1 + m);

    int l = 1, r = 0, last = 0;
    for (int i = 1; i <= m; i++) {
        if (pos[q[i].l] == pos[q[i].r]) {
            LL res = 0;
            for (int j = q[i].l; j <= q[i].r; j++)
                s[a[j]]++, res = max(res, (LL)s[a[j]] * d[a[j]]);
            ans[q[i].id] = res;
            for (int j = q[i].l; j <= q[i].r; j++) s[a[j]]--;
            continue;
        }
        if (pos[q[i].l] != last) {
            for (int j = l; j <= r; j++) cnt[a[j]] = 0;
            l = r = R[pos[q[i].l]], cnt[a[l]] = 1; 
            sum = d[a[l]], last = pos[q[i].l];
        }
        while (r < q[i].r) add(a[++r]);
        LL tmp = sum;
        for (int j = l - 1; j >= q[i].l; j--) add(a[j]);
        ans[q[i].id] = sum;
        for (int j = l - 1; j >= q[i].l; j--) del(a[j]);
        sum = tmp;
    }
    for (int i = 1; i <= m; i++) printf("%lld\n", ans[i]);
    return 0;
}