CF103D.Time to Raid Cowavans

As you know, the most intelligent beings on the Earth are, of course, cows. This conclusion was reached long ago by the Martian aliens, as well as a number of other intelligent civilizations from outer space.

Sometimes cows gather into cowavans. This seems to be seasonal. But at this time the cows become passive and react poorly to external stimuli. A cowavan is a perfect target for the Martian scientific saucer, it's time for large-scale abductions, or, as the Martians say, raids. Simply put, a cowavan is a set of cows in a row.

If we number all cows in the cowavan with positive integers from 1 to n, then we can formalize the popular model of abduction, known as the (a, b)-Cowavan Raid: first they steal a cow number a, then number a + b, then — number a + 2·b, and so on, until the number of an abducted cow exceeds n. During one raid the cows are not renumbered.

The aliens would be happy to place all the cows on board of their hospitable ship, but unfortunately, the amount of cargo space is very, very limited. The researchers, knowing the mass of each cow in the cowavan, made p scenarios of the (a, b)-raid. Now they want to identify the following thing for each scenario individually: what total mass of pure beef will get on board of the ship. All the scenarios are independent, in the process of performing the calculations the cows are not being stolen.

众所周知，地球上最聪明的生物当然是奶牛。这一结论早已被火星外星人以及来自外太空的其他若干智慧文明所证实。

有时，奶牛会聚集形成“牛队列”（cowavan）。这种现象似乎具有季节性。但此时奶牛会变得十分被动，对外界刺激反应迟钝。“牛队列”恰好成为火星科学家飞碟的理想目标，大规模绑架行动（即火星人所说的“突袭”）的时机已然成熟。简而言之，“牛队列”就是一排排成一线的奶牛。

若我们将“牛队列”中的所有奶牛从 1 到 $n$ 用正整数编号，则广为人知的绑架模型——$(a,\,b)$-牛队列突袭——可形式化定义如下：首先劫走编号为 $a$ 的奶牛，接着劫走编号为 $a + b$ 的奶牛，然后是编号为 $a + 2\cdot b$ 的奶牛，依此类推，直到待劫奶牛的编号超过 $n$ 为止。在单次突袭过程中，奶牛的编号不会重新调整。

外星人本希望将所有奶牛全部运上他们那艘热情好客的飞船，但遗憾的是，飞船货舱空间极其、极其有限。研究人员已获知“牛队列”中每头奶牛的质量，并为此 $(a,\,b)$-突袭制定了 $p$ 种不同方案。现在，他们希望针对每一种方案分别确定：最终登上飞船的纯牛肉总质量是多少？所有方案彼此独立；在进行计算过程中，奶牛并未实际被劫走。

The first line contains the only positive integer n (1 ≤ n ≤ 3·105) — the number of cows in the cowavan.

The second number contains n positive integer w__i, separated by spaces, where the i-th number describes the mass of the i-th cow in the cowavan (1 ≤ w__i ≤ 109).

The third line contains the only positive integer p — the number of scenarios of (a, b)-raids (1 ≤ p ≤ 3·105).

Each following line contains integer parameters a and b of the corresponding scenario (1 ≤ a, b ≤ n).

第一行包含唯一的一个正整数 $n$（$1 \leq n \leq 3\cdot10^5$）——牛群中的奶牛数量。

第二行包含 $n$ 个正整数 $w_i$，以空格分隔，其中第 $i$ 个数表示牛群中第 $i$ 头奶牛的质量（$1 \leq w_i \leq 10^9$）。

第三行包含唯一的一个正整数 $p$ —— $(a, b)$ 型突袭场景的数量（$1 \leq p \leq 3\cdot10^5$）。

接下来的每一行包含对应场景的整数参数 $a$ 和 $b$（$1 \leq a, b \leq n$）。

Print for each scenario of the (a, b)-raid the total mass of cows, that can be stolen using only this scenario.

Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams of the %I64d specificator.

对于每种 $(a, b)$-劫掠方案，请输出仅使用该方案所能窃取的奶牛的总质量。

请注意，在 C++ 中读写 64 位整数时，请勿使用 %lld 格式说明符。建议使用 cin/cout 流或 %I64d 格式说明符。