#include<cstdio>
long long a[100005];
long long sum[100005];
int vis[100005];
int step[100005];
long long pre[100005];

long long getSum(int r,int k,int n){
    long long mask = r, res = 0;
    for(int i = 0; i < k; i++){
        res += a[mask];
        mask = (mask+a[mask])%n;
    }
    return res;
}

int main(){
    int n;
    scanf("%d",&n);
    for(int i = 0; i < n; i++) scanf("%lld",&a[i]);
    vis[0] = 1, step[0] = 0, sum[0] = 0;
    pre[step[0]] = sum[0];
    int u = 0; 
    long long cycle = -1, start = -1;
    long long weight = 0;
    while(true){
        int v = (u+a[u])%n;
        if(vis[v]==1){
            cycle = step[u]+1-step[v];
            start = v;
            weight = sum[u]+a[u]-sum[v];
            break;
        }
        else{
            vis[v] = 1;
            step[v] = step[u]+1;
            sum[v] = sum[u]+a[u];
            pre[step[v]] = sum[v];
            u = v;
        }
    }
    //printf("start = %lld, cycle = %lld, weight = %lld\n",start,cycle,weight);
    int q;
    scanf("%d",&q);
    while(q--){
        long long k;
        scanf("%lld",&k);
        if(k<step[start]) printf("%lld\n",pre[k]);
        else{
            long long ans = 0;
            k -= step[start];
            ans += sum[start];
            long long cnt = k/cycle;
            //printf("ans = %lld, cnt = %lld\n",ans,cnt);
            ans += cnt*weight;
            long long left = k%cycle;
            ans += pre[step[start]+left]-pre[step[start]];
            printf("%lld\n",ans);
        }
    }
    
    return 0;
}