Periodic Sum

Given an array $A$ of size $n$. There are $q$ queries. For each query, you are given $l, r, d$. and you have to find $F(l, r, d)$, where $$F(l, r, d) = \sum_{i=0}^{(r-i*d) \geq l}A[r-i*d]$$ ###Input: - First line will contain $n$, size of the array. - Second line contain $n$ space separated integer representing $A_1, A_2...A_n$. - Third line contain $q$ representing numbur of query. T