#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<vector>
#include<queue>
#include<algorithm>
#include<string>
#include<sstream>
#include<cctype>
#include<cmath>
#include<iomanip>
#include<map>
#include<stack>
#include<set>
#include<functional>
#define in(x) x=read()
#define qr read()
// #define int ll
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
namespace fastIO
{
    #define BUF_SIZE 100000
    bool IOerror=0;
    inline char nc()
	{
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
        if (p1==pend){
            p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin);
            if (pend==p1){IOerror=1;return -1;}
        }
        return *p1++;
    }
    inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
    inline ll read()
	{
        bool sign=0; char ch=nc();ll x=0;
        for (;blank(ch);ch=nc());
        if (IOerror)return 0;
        if (ch=='-')sign=1,ch=nc();
        for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';
        if (sign)x=-x;
        return x;
    }
    #undef BUF_SIZE
};
using namespace fastIO;
#define blk 450
unsigned sum[500][200010];
int a[1000010];
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int n=qr;
	for(int i=1;i<=n;i++)in(a[i]);
	for(int j=1;j<=blk;j++)
	for(int i=1;i<=n;i++)
	{
		sum[j][i]=sum[j][max(0,i-j)]+a[i];
	}
	int m=qr;
	while(m--)
	{
		int d=qr,p1=qr,p2=qr;
		unsigned ans=0;
		for(int p=p2,j=0;j<d;p+=d,j++)
		{
			// cout<<p+d-1<<"-"<<p-1<<'\n';
			// cout<<j<<":"<<(sum[1][p+d-1]-sum[1][p-1])<<' '<<(sum[d][p1+d*(d-1)+j]-sum[d][p1+j-d])<<'\n';
			ans+=(sum[1][p+d-1]-sum[1][p-1])*(sum[d][p1+d*(d-1)+j]-sum[d][p1+j-d]);
		}
		cout<<ans<<'\n';
	}
	return 0;
}