#include<bits/stdc++.h>
using namespace std;
#define ri int
typedef long long ll;
const int maxn=2e5+3,maxp=450;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
template<class T>inline void clear(T *arr,int siz,int val=0){memset(arr,val,sizeof(T)*(siz+1));}
int a[maxn],m,mx,n;
// sum_j sum[p1+j][d]*(pre[p2+d*(j+1)-1]-pre[p2+d*j-1])
unsigned int pre[maxn],sum[maxn][maxp];
int main(){
	scanf("%d",&n);
	mx=sqrt(n+1);
	for(ri i=1;i<=n;++i)scanf("%d",a+i),pre[i]=pre[i-1]+a[i];
	for(ri i=n;i;--i)
		for(ri j=1;j<=mx;++j){
			sum[i][j]=(i+j<=n?sum[i+j][j]:0)+a[i];
			if(i+j*j<=n)sum[i][j]-=a[i+j*j];
		}
	scanf("%d",&m);
	while(m--){
		ri d,p1,p2;
		scanf("%d%d%d",&d,&p1,&p2);
		unsigned int ans=0;
		for(ri j=0;j<d;++j)ans+=sum[p1+j][d]*(pre[p2+d*(j+1)-1]-pre[p2+d*j-1]);
		printf("%lld\n",ans);
	}
	return 0;
}