#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define endl '\n'

/*

n = 7

a0 = 9
*/

int main() {
    // ll t; cin >> t;

    // while (t--) {
        ll n; cin >> n;
        
        vector<ll> v(n);
        
        for (int i = 0; i < n; ++i) cin >> v[i];
        ll q; cin >> q;
        
        ll thresh = 0;

        vector<ll> precomp(n + 3, 0);

        map<ll, ll> freq;

        ll x = 0;
        ll sum = 0;

        ll thresh2 = 0;

        ll bforeloop = 0;

        vector<ll> precomp2(n + 3, 0);

        while (true) {
            ll idx = x % n;
            freq[idx]++;

            if (freq[idx] > 1) {
                if (freq[idx] > 2) break;
                x += v[idx];
                sum += v[idx];

                thresh2++;
                precomp2[thresh2] = sum;

                continue;
            }

            ++thresh;
            bforeloop = thresh;
            
            x += v[idx];
            // sum += v[idx];
            
            precomp[thresh] = x;
        }

        while (q--) {
            ll k; cin >> k;

            ll ans = 0;

            if (k >= bforeloop) {
                ans += precomp[bforeloop];
                k -= bforeloop;

                ll mult = k / thresh2;
                ans += sum * mult;

                ll off = k % thresh2;
                ans += precomp2[off];

                cout << ans << endl;
            }
            else {
                cout << precomp[k] << endl;
            }
        }
    // }
}