// 
#include <bits/stdc++.h>
#define LL long long
#define mes(s, x) memset(s, x, sizeof(s))
#define Maxn 200005
#define Maxb 500
using namespace std;
inline LL read(){char c;c = getchar();while(!(('0' <= c && c <= '9') || c == '-')) c = getchar();bool flag = 0;if(c == '-'){flag = 1;c = getchar();}LL tot = 0;while('0' <= c && c <= '9'){tot = 10 * tot + c - '0';c = getchar();}return flag ? -tot : tot;}
struct query{
    int r, x, id;
};
vector<query> q[Maxb], nq;
int a[Maxn], ans[Maxn], f[2 * Maxn];
int find(int i){
    if(i == f[i]) return i;
    return f[i] = find(f[i]);
}
void merge(int i, int j){
    i = find(i), j = find(j);
    f[i] = j;
}
int main(){
    #ifndef ONLINE_JUDGE
        freopen("in","r",stdin);
        freopen("out","w",stdout);
    #endif
    int n = read(), m, blk, x, y, z, s, k, tl;
    blk = sqrt(n) + 0.5;
    for(int i = 1; i <= n; i++) a[i] = read();
    m = read();
    for(int i = 1; i <= m; i++){
        x = read(), y = read(), z = read();
        if((x - 1) / blk == (y - 1) / blk){
            for(int j = x; j <= y; j++) z += (z <= 0 ? a[j] : -a[j]);
            ans[i] = z;
        }else{
            for(int j = x; j <= ((x - 1) / blk + 1) * blk; j++) z += (z <= 0 ? a[j] : -a[j]);
            q[(x - 1) / blk + 2].push_back({y, z, i});
        }
    }
    for(int i = 1, l, r; (i - 1) * blk < n; i++){
        l = (i - 1) * blk + 1, r = min(i * blk, n);
        for(int j = 0; j <= 400000; j++) f[j] = j;
        s = 0, z = 0, x = 1, y = 200000 - 1, k = 1;
        for(int j = l; j <= r; j++){
            s += a[j];
            z += (z <= 0 ? a[j] : -a[j]);
            k += (2 * k + l <= 0 ? a[j] : -a[j]);
            if(k < 0 && k + y > 0){
                if(-k > k + y){
                    for(int o = 1; o <= k + y; o++){
                        merge(x - k + o + 200000, -(x - k - o) + 200000);
                        merge(-(x - k + o) + 200000, x - k - o + 200000);
                    }
                    y = -k;
                }else{
                    for(int o = k; o < 0; o++){
                        merge(x - k + o + 200000, -(x - k - o) + 200000);
                        merge(-(x - k + o) + 200000, x - k - o + 200000);
                    }
                    x = x - k;
                    y = y + k;
                    k = 0;
                }
            }
        }
        for(int j = 0; j < q[i].size(); j++){
            if(q[i][j].r <= r){
                tl = q[i][j].x;
                for(int o = l; o <= q[i][j].r; o++) tl += (tl <= 0 ? a[o] : -a[o]);
                ans[q[i][j].id] = tl;
            }else{
                if(abs(q[i][j].x) > 200000){
                    if(abs(q[i][j].x) >= s) q[i][j].x += (q[i][j].x > 0 ? -s : s);
                    else{
                        tl = q[i][j].x;
                        for(int o = l; o <= q[i][j].r; o++) tl += (tl <= 0 ? a[o] : -a[o]);
                        q[i][j].x = tl;
                    }
                }else if(q[i][j].x == 0){
                    q[i][j].x = z;
                }else{
                    tl = find(q[i][j].x + 200000) - 200000;
                    if(tl > 0) tl = tl - x + k;
                    else tl = -(-tl - x + k);
                    q[i][j].x = tl;
                }
                q[i + 1].push_back(q[i][j]);
            }
        }
        q[i].clear();
        q[i].shrink_to_fit();
    }
    for(int i = 1; i <= m; i++) printf("%d\n", ans[i]);
	return 0;
}