#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std ;

#define int unsigned int
const int N = 200005 ;
int n , m , a[N] , s[200005][205] , ans[N] , v[N] ;

struct Node {
	int d , p1 , p2 , id ;
} q[N] ;

inline bool cmp ( Node u , Node v ) {
	return u .d < v .d ;
}

inline int cd ( int x , int nq ) {
	return ( x - 1 ) / nq + 1 ;
}

inline int cm ( int x , int nq ) {
	return ( x - 1 ) % nq + 1 ;
}

signed main ( ) {
	cin >> n ;
	for ( int i = 1 ; i <= n ; ++ i )
		cin >> a [ i ] , v [ i ] = v [ i - 1 ] + a [ i ] ;
	cin >> m ;
	for ( int i = 1 ; i <= m ; ++ i ) {
		cin >> q [ i ] .d >> q [ i ] .p1 >> q [ i ] .p2 ;
		q [ i ] .id = i ;
	}
	sort ( q + 1 , q + 1 + m , cmp ) ;
	int p = 1 ;
	for ( int c = 1 ; c * c <= n ; ++ c ) {
		if ( q [ p ] .d > c ) continue ;
		int nc = cd ( n , c ) ;
		for ( int i = 1 ; i <= c * nc ; ++ i )
			s [ cd ( i , c ) ] [ cm ( i , c ) ] = a [ i ] ;
		for ( int i = 1 ; i <= nc ; ++ i )
			for ( int j = 1 ; j <= c ; ++ j )
				s [ i ] [ j ] += s [ i - 1 ] [ j ] ;
		while ( q [ p ] .d == c ) {
			for ( int i = 0 ; i < c ; ++ i ) {
				int w1 = cm ( q [ p ] .p1 + i , c ) , n1 = cd ( q [ p ] .p1 + i , c ) - 1 , p2 = q [ p ] .p2 ;
				ans [ q [ p ] .id ] += ( s [ n1 + c ] [ w1 ] - s [ n1 ] [ w1 ] ) * ( v [ p2 + ( i + 1 ) * c - 1 ] - v [ p2 + i * c - 1 ] ) ;
			}
			++ p ;
		}
		while ( q [ p ] .d == c ) {
			for ( int i = 0 ; i < c ; ++ i ) {
				int w1 = cm ( q [ p ] .p1 + i , c ) , n1 = cd ( q [ p ] .p1 + i , c ) - 1 ;
				int w2 = cm ( q [ p ] .p2 + i , c ) , n2 = cd ( q [ p ] .p2 + i , c ) - 1 ;
				ans [ q [ p ] .id ] += ( s [ n1 + c ] [ w1 ] - s [ n1 ] [ w1 ] ) * ( s [ n2 + c ] [ w2 ] - s [ n2 ] [ w2 ] ) ;
			}
			++ p ;
		}
	}
	for ( int i = 1 ; i <= m ; ++ i )
		cout << ans [ i ] << "\n" ;
	return 0 ;
}