#include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
inline int64_t gilbertOrder(int x, int y, int pow, int rotate) {
if (pow == 0) {
return 0;
}
int hpow = 1 << (pow-1);
int seg = (x < hpow) ? (
(y < hpow) ? 0 : 3
) : (
(y < hpow) ? 1 : 2
);
seg = (seg + rotate) & 3;
const int rotateDelta[4] = {3, 0, 0, 1};
int nx = x & (x ^ hpow), ny = y & (y ^ hpow);
int nrot = (rotate + rotateDelta[seg]) & 3;
int64_t subSquareSize = int64_t(1) << (2*pow - 2);
int64_t ans = seg * subSquareSize;
int64_t add = gilbertOrder(nx, ny, pow-1, nrot);
ans += (seg == 1 || seg == 2) ? add : (subSquareSize - add - 1);
return ans;
}
struct Node {
int l, r, i;
int64_t ord;
inline void calcOrder() {
ord = gilbertOrder(l, r, 17, 0);
}
bool operator<(const Node &n) {
return ord < n.ord;
}
};
const int SZ = 131072;
int N, Q;
int A[100101], B[100101];
ll res[100101], seg[270000];
vector<Node> q;
priority_queue<ll> pq, del;
vector<int> com;
void Update(int n, int val) // 0-based
{
n += SZ; seg[n] += val;
for(n>>=1; n; n>>=1) seg[n] = max(seg[n<<1], seg[n<<1|1]);
}
int main()
{
scanf("%d %d", &N, &Q);
for(int i=1; i<=N; i++)
{
scanf("%d", &A[i]);
com.push_back(A[i]);
}
// 좌표 압축
sort(com.begin(), com.end());
com.erase(unique(com.begin(), com.end()), com.end());
for(int i=1; i<=N; i++)
B[i] = lower_bound(com.begin(), com.end(), A[i]) - com.begin();
// 오프라인 쿼리
for(int i=1; i<=Q; i++)
{
int l, r;
scanf("%d %d", &l, &r);
q.push_back({l, r, i});
}
sort(q.begin(), q.end());
// MO's
int l = 1, r = 0; // [l, r]
for(int i=0; i<q.size(); i++)
{
int nl = q[i].l, nr = q[i].r, idx = q[i].i;
while(r < nr)
{
r++;
Update(B[r], A[r]);
}
while(l < nl)
{
Update(B[l], -A[l]);
l++;
}
while(nl < l)
{
l--;
Update(B[l], A[l]);
}
while(nr < r)
{
Update(B[r], -A[r]);
r--;
}
res[idx] = seg[1];
}
for(int i=1; i<=Q; i++)
printf("%lld\n", res[i]);
return 0;
}
