#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define int long long
const int N=200000,B=500,Db=N/B+1;vector<int> g[N+N+5];
int n,q,a[N+5],s[N+5],tot,L[Db+5],R[Db+5],bel[N+5],tr[Db+5][N+N+5];/*[0,N+N]->[-N,N]*/
void dfs(int*ans,int u,int x){
	ans[u]=x;for(auto v:g[u])dfs(ans,v,1-x);
}
int calc(int l,int r,int x){
	if(bel[l]==bel[r]){
		for(int i=l;i<=r;i++)x=x<=0?x+a[i]:x-a[i];return x;
	}
	int bl=bel[l];
	while(bel[l]==bl)x=x<=0?x+a[l]:x-a[l],l++;
	for(int i=bel[l];i<bel[r];i++)x=tr[i][x+N];
	l=L[bel[r]];while(l<=r)x=x<=0?x+a[l]:x-a[l],l++;return x;
}
void work(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i],s[i]=s[i-1]+a[i];
	for(int i=1;i<=n;i++)bel[i]=(i-1)/B+1;tot=bel[n];
	for(int i=1;i<=tot;i++)L[i]=R[i-1]+1,R[i]=i*B;R[tot]=n;
	for(int _=1;_<=tot;_++){
		for(int i=0;i<=N+N;i++)g[i].clear();
		int mid=N,l=0,r=N+N;
		for(int i=L[_];i<=R[_];i++){
			assert(l!=mid);
			if(r<=mid)mid-=a[i];else mid+=a[i];
			if(l<=mid&&mid<r){
				if(mid-l+1<=r-mid){
					for(int i=l;i<=mid;i++)g[mid+mid-i+1].pb(i);l=mid+1;
				}else{
					for(int i=mid+1;i<=r;i++)g[mid+mid-i+1].pb(i);r=mid;
				}
			}
		}
		for(int i=l;i<=r;i++)dfs(tr[_],i,i-mid);
	}
	cin>>q;while(q--){
		int l,r,x;
		cin>>l>>r>>x;
		while(l<=r&&abs(x)>a[l])x=x<=0?x+a[l]:x-a[l],l++;
		if(l>r)cout<<x<<'\n';else cout<<calc(l,r,x)<<'\n';
	}
}
signed main(){
	ios::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
	int T=1;while(T--)work();return 0;
}