#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int N;
int A[100000];
int B[100000];
int Q;
int idx[100000];
bool used[100000];

int s;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N;
    for(int i = 0; i < N; i++) cin >> A[i];
    cin >> Q;
    for(int i = 0; i < N; i++){
        int to = (i+A[i])%N;
        B[i] = to;
    }
    int cur = 0;
    int cnt = 0;
    int loop;
    int s;
    ll sum = 0;
    ll loop_sum = 0;
    vector<ll> v, v_loop;
    while(true){
        used[cur] = true;
        idx[cur] = cnt;
        cur = B[cur];
        cnt++;
        if(used[cur]) {
            s = cur;
            break;
        }
    }
    cur = 0;
    while(true){
        if(cur == s) break;
        sum += A[cur];
        v.push_back(sum);
        cur = B[cur];
    }
    cur = s;
    cnt = 0;
    while(true){
        if(cur == s && cnt > 0) break;
        loop_sum += A[cur];
        v_loop.push_back(loop_sum);
        cur = B[cur];
        cnt++;
    }
    for(int i = 0; i < Q; i++){
        ll K;
        ll ans = 0;
        cin >> K;
        if(K > v.size()){
            ans = sum;
            K -= v.size();
            ll m = K/(v_loop.size());
            ll r = K%(v_loop.size());
            ans += m*loop_sum;
            if(r > 0) ans += v_loop[r-1];
        }else{
            ans = v[K-1];
        }
        cout << ans << endl;
    }
}