N = int(input())
A = list(map(int, input().split()))
M = [(i + a) % N for i, a in enumerate(A)]

cur = 0
t = 0
visited = dict()
Acc_tail = [0]
while cur not in visited:
    visited[cur] = t
    Acc_tail.append(Acc_tail[-1] + A[cur])
    cur = M[cur]
    t += 1

Acc_tail.append(Acc_tail[-1] + A[cur])

tail = visited[cur] + 1
loop_length = t - tail + 1
Acc_loop = [x - Acc_tail[tail] for x in Acc_tail[tail + 1:]]


def solve(K):
    if K < len(Acc_tail):
        return Acc_tail[K]
    else:
        K -= tail
        ret = Acc_tail[tail] + Acc_loop[-1] * (K // loop_length)
        if K % loop_length:
            ret += Acc_loop[K % loop_length - 1]
        return ret


Q = int(input())
for _ in range(Q):
    print(solve(int(input())))