#include<bits/stdc++.h>
#define rep(i,a,b) for (register int i=(a);i<=(b);i++)
#define drep(i,a,b) for (register int i=(a);i>=(b);i--)
typedef long long ll;
using namespace std;

typedef unsigned int uint;
const int N=200010,M=sqrt(N)+5;

int n;
uint a[N],s[N][M];

int main()
{
	cin>>n;
	rep(i,1,n) cin>>a[i];
	int mx=sqrt(n);
	rep(i,1,n)
	{
		rep(d,1,mx)
		{
			s[i][d]=a[i];
			if (i>=d) s[i][d]+=s[i-d][d];
		}
	}
	
	int q; cin>>q;
	rep(_,1,q)
	{
		int d,p1,p2; cin>>d>>p1>>p2;
		uint ans=0;
		rep(i,0,d-1)
		{
			uint v=s[p2+(i+1)*d-1][1]-s[p2+i*d-1][1];
			uint w=s[p1+(d-1)*d+i][d];
			if (p1+i>=d) w-=s[p1+i-d][d];
			ans+=v*w;
		}
		printf("%u\n",ans);
	}
	return 0;
}