#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    ll a[n];
    rep(i,n) cin >> a[i];
    ll Q;
    cin >> Q;
    ll k[Q];
    rep(i,Q) cin >> k[i];

    ll x = 0;
    ll f[n];
    ll xx[n];
    rep(i,n) f[i] = -1;
    ll loop = 0;
    f[0] = 0;
    xx[0] = 0;
    int cnt = 0;
    vector<ll> v;
    v.push_back(x);
    while(true){
        cnt++;
        x += a[x%n];
        v.push_back(x);
        if(f[x%n] != -1) break;
        f[x%n] = cnt;
        xx[x%n] = x;
    }

    loop = cnt - f[x%n];
    ll sum = x - xx[x%n];

    rep(i,Q){
        if(k[i]<=cnt){
            cout << v[k[i]] << endl;
            continue;
        }

        ll ans = v[f[x%n]];
        k[i] -= f[x%n];
        ans += k[i] / loop * sum;
        k[i] %= loop;
        ans += v[f[x%n]+k[i]] - v[f[x%n]];
        cout << ans << endl;
    }

    return 0;
}