#include <iostream>
#include <vector>
using namespace std;
using ll = long long int;

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(auto &p: a) cin >> p;
    int q;
    cin >> q;
    vector<int> k(q);
    for(auto &p: k) cin >> p;

    vector<int> order(n+10, -1);
    vector<ll> x(n+10, 0);
    ll loopstart, loopend, mod, prenum;
    for(int i = 1, r = 0; ; i++){
        order[r] = i;
        x[i] = x[i-1] + a[r];
        int prevr = r;
        r = x[i]%n;
        if(order[r] != -1){
            loopstart = order[r];
            loopend = order[prevr];
            prenum = order[r]-1;
            mod = loopend - loopstart + 1;
            //cerr << loopstart << " " << loopend << endl;
            break;
        }
    }

    vector<ll> loopsum(mod+1);
    for(int i = 0; i < mod; i++) loopsum[i] = x[i+loopstart]-x[loopstart-1];

    for(auto &p: k){
        if(p < loopstart) cout << x[p] << endl;
        else{
            ll ans = x[loopstart-1];
            ll loopcnt = (p-loopstart+1)/mod;
            ll loopind = (p-loopstart+1)%mod -1;
            ans += loopcnt * loopsum[mod-1];
            if(loopind != -1) ans += loopsum[loopind];
            cout << ans << endl;
        }
    }
    return 0;
}