#include <fstream>
#include <algorithm>
 
using namespace std;
 
ifstream cin("sequencequery.in");
ofstream cout("sequencequery.out");
 
#define NMAX 100001
#define ll long long

ll n, i, x, y, m, sum;
ll x1;
struct nanu {
    ll secv, s, d, total;
}arbore[4 * NMAX];
 
static inline void update(int a, int b, int nod, int poz, int val) {
    if(a == b) {
        arbore[nod].secv = arbore[nod].s = arbore[nod].d = arbore[nod].total = val; 
    }else {
        int mid = (a + b) / 2;
        if(poz <= mid)
            update(a, mid, nod * 2, poz, val);
        else update(mid + 1, b, nod * 2 + 1, poz, val);
        arbore[nod].secv = max(arbore[nod * 2].secv, max(arbore[nod * 2 + 1].secv, arbore[nod * 2].s + arbore[nod * 2 + 1].d));
        arbore[nod].s = max(arbore[nod * 2].s, arbore[nod * 2 + 1].s + arbore[nod * 2].total);
        arbore[nod].d = max(arbore[nod * 2 + 1].d, arbore[nod * 2].d + arbore[nod * 2 + 1].total);
        arbore[nod].total = arbore[nod * 2].total + arbore[nod * 2 + 1].total;
    }
} 
 
static inline void query(int a, int b, int nod, int st, int dr) {
    if(st <= a && b <= dr) {
        if(sum < 0)//secventa de suma maxima
            sum = 0;
        x1 = max(x1, max(sum + arbore[nod].s, arbore[nod].secv));
        sum = max(arbore[nod].total + sum, arbore[nod].d);
        return;
    }
    int mid = (a + b) / 2;
    if(st <= mid)
        query(a, mid, nod * 2, st, dr);
    if(mid < dr)
        query(mid + 1, b, nod * 2 + 1, st, dr);
}
 
int main() {
    for(i = 1; i <= 4 * NMAX; i++)
        arbore[i].secv = arbore[i].s = arbore[i].d = (-4) * NMAX;
 
    cin >> n >> m;
    for(i = 1; i <= n; i++) {
        cin >> x;   
        update(1, n, 1, i, x);
    }
 
    for(i = 1; i <= m; i++) {
        cin >> x >> y;
        sum = 0;
        x1 = -NMAX;
        query(1, n, 1, x, y);
        cout << x1 << '\n';
    }
 
    return 0;
}