class Scanner {
    private var stack = [String]()
    private var index = 0
    
    func peek() -> String {
        if stack.count == index {
            stack += readLine()!.split(separator: " ").map{ String($0) }
        }
        return stack[index]
    }
    
    func next() -> String {
        let value = peek()
        index += 1
        return value
    }
    
    func nextInt() -> Int {
        return Int(next())!
    }
    
    func nextDouble() -> Double {
        return Double(next())!
    }
}

let scanner = Scanner()
let N = scanner.nextInt()
let A = (0 ..< N).map { _ in scanner.nextInt() }
let Q = scanner.nextInt()

var time = [Int?](repeating: nil, count: N)

var index = 0
var now = 0
var footprints = [Int]()
while time[index] == nil {
    footprints.append(index)
    time[index] = now
    now += 1
    index += A[index]
    index %= N
}
let periodStart = time[index]!
let periodLength = now - time[index]!

var prefixSum = [Int](repeating: 0, count: footprints.count + 1)
for i in 0 ..< footprints.count {
    prefixSum[i + 1] = prefixSum[i] + A[footprints[i]]
}

for _ in 0 ..< Q {
    var K = scanner.nextInt()
    if K < periodStart {
        print(prefixSum[K])
    } else {
        var answer = 0
        answer += prefixSum[periodStart]
        K -= periodStart
        answer += (prefixSum[footprints.count] - prefixSum[periodStart]) * (K / periodLength)
        K %= periodLength
        answer += (prefixSum[periodStart + K] - prefixSum[periodStart])
        print(answer)
    }
}