#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 1987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int n,m,sz,N;
ll a[100000];
int cnt[1000001];
ll ans[100000];
struct query {
int l, r, i;
query() :query(0, 0, 0) {}
query(int L, int R, int I) :l(L), r(R), i(I) {}
bool operator < (const query& Q)
{
int lg = r / sz, rg = Q.r / sz;
return lg == rg ? l < Q.l : lg < rg;
}
}q[100000];
Vll vv;
ll tree[200005];
inline void add(int x)
{
tree[x+N]+=vv[x];
for(int i=(x+N)/2;i>0;i>>=1)tree[i]=max(tree[i*2],tree[i*2+1]);
}
inline void erase(int x)
{
tree[x+N]-=vv[x];
for(int i=(x+N)/2;i>0;i>>=1)tree[i]=max(tree[i*2],tree[i*2+1]);
}
int main() {
scanf("%d%d",&n,&m);
sz = sqrt(n);
fup(i, 0, n - 1, 1)
{
scanf("%lld", a + i);
vv.pb(a[i]);
}
sort(ALL(vv));
vv.resize(unique(ALL(vv))-vv.begin());
fup(i,0,n-1,1)a[i]=lower_bound(ALL(vv),a[i])-vv.begin();
N=vv.size();
fup(i, 0, m - 1, 1)
{
int L, R;
scanf("%d%d", &L, &R);
q[i] = query(L-1, R-1, i);
}
sort(q, q + m);
int L = 0, R = 0;
add(a[0]);
for (int i = 0; i < m; i++)
{
int nl = q[i].l, nr = q[i].r;
if (nr > R)
{
for (int k = R + 1; k <= nr; k++)
add(a[k]);
}
if (nr<R)
{
for (int k = R; k > nr; k--)
erase(a[k]);
}
if (nl < L)
{
for (int k = L - 1; k >= nl; k--)
add(a[k]);
}
if (nl > L)
{
for (int k = L; k < nl; k++)
erase(a[k]);
}
ans[q[i].i] = tree[1];
L = nl, R = nr;
}
fup(i, 0, m - 1, 1)printf("%lld\n", ans[i]);
}
