#include <bits/stdc++.h>

using namespace std;
ifstream f("sequencequery.in");
ofstream g("sequencequery.out");
struct arbore
{
    int a,b,c,s;
}arb[400005];
void update (int st,int dr,int nod,int poz,int val)
{
    if (st==dr)
    {
        arb[nod].a=val;
        arb[nod].b=val;
        arb[nod].c=val;
        arb[nod].s=val;
        return;
    }
    int mij=(st+dr)/2;
    if (poz<=mij)
    {
        update(st,mij,2*nod,poz,val);
    }
    else
    {
        update(mij+1,dr,2*nod+1,poz,val);
    }
    arb[nod].a=max(arb[2*nod].a,arb[2*nod].s+arb[2*nod+1].a);
    arb[nod].b=max(arb[2*nod+1].b,arb[2*nod+1].s+arb[2*nod].b);
    arb[nod].c=max(arb[2*nod].b+arb[2*nod+1].a,max(arb[2*nod].c,arb[2*nod+1].c));
    arb[nod].s=arb[2*nod].s+arb[2*nod+1].s;
}
int s,ans;
void query (int st,int dr,int nod,int ua,int ub)
{
    if (ua<=st&&dr<=ub)
    {
        ans=max(ans,max(s+arb[nod].a,arb[nod].c));
        s=max(s+arb[nod].s,arb[nod].b);
        return ;
    }
    int mij=(st+dr)/2;
    if (ua<=mij)
    {
        query(st,mij,2*nod,ua,ub);
    }
    if (mij<ub)
    {
        query(mij+1,dr,2*nod+1,ua,ub);
    }
}
int n,i,v[100005],q,x,y;
int main()
{
    f>>n>>q;
    for (i=1;i<=n;i++)
    {
        f>>v[i];
        update(1,n,1,i,v[i]);
    }
    for (i=1;i<=q;i++)
    {
        f>>x>>y;
        s=ans=-100001;
        query (1,n,1,x,y);
        g<<ans<<'\n';
    }
    return 0;
}