import math

N = int(input())
A = list(map(int,input().split()))
Q = int(input())

# 二次元配列作成
nex = []
nsum = []

for _ in range(int(math.log2(10**13))):
    l1 = [0] * N
    l2 = [0] * N
    nex.append(l1)
    nsum.append(l2)

# dv[0][0:X]を初期化
for n in range(N):
    nex[0][n] = (n+A[n])%N
    nsum[0][n] = A[n]

# ダブリングで表を構築
for k in range(1, int(math.log2(10**13))):
    for n in range(N):
        nex[k][n] = nex[k - 1][nex[k - 1][n]]
        nsum[k][n] = nsum[k - 1][n] + nsum[k - 1][nex[k - 1][n]]

for _ in range(Q):
    K = int(input())
    a = []
    for i in range(int(math.log2(K)) + 1):
        if K>>i & 1:
            a.append(i)

    ans = 0
    X = 0
    for i in a:
        ans += nsum[i][X]
        X = nex[i][X]
    print(ans)