#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

int main(){
    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    vector<int> seen(n,-1);
    vector<ll> num;
    int c = 0;
    ll now = 0;
    int cyc = -1;
    int id = -1;
    while(1){
        if(seen[now%n]>=0){
            cyc = c - seen[now%n];
            id = now%n;
            break;
        }
        seen[now%n] = c++;
        now += a[now%n];
        num.push_back(now);
    }
    ll s = 0;
    if((int)(num.size()) - cyc - 1 < 0) s = num.back();
    else s = num.back() - num[(int)(num.size()) - cyc - 1];
    /*
    rep(i,num.size()) cout << num[i] << " ";
    cout << endl;
    cout << cyc << endl;
    cout << id << endl;
    cout << s << endl;
    */

    int q;
    cin >> q;
    while(q--){
        ll k;
        cin >> k;
        if(k <= (int)(num.size()) - cyc){
            cout << num[k-1] << endl;
        }else{
            k -= (int)(num.size()) - cyc;
            ll res = 0;
            if((int)(num.size()) - cyc - 1 < 0) res = 0;
            else res = num[(int)(num.size()) - cyc - 1];
            res += (k/cyc) * s;
            if(k%cyc!=0){
                if((int)(num.size()) - cyc - 1 >= 0) res += num[(int)(num.size()) - cyc - 1 + k%cyc] - num[(int)(num.size()) - cyc - 1];
                else res += num[(int)(num.size()) - cyc - 1 + k%cyc];
            }
            cout << res << endl;
        }
    }

    return 0;
}