#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const int inf=1e9+7;
const ll INF=1e18;

int main(){
    ll n;cin>>n;
    vll a(n);rep(i,n)cin>>a[i];
    set<ll> r;
    vll x;x.push_back(0);
    ll tmp;ll sum=0;
    while(1){
        tmp=sum%n;
        if(r.count(tmp))break;
        r.insert(tmp);
        sum+=a[tmp];
        x.push_back(sum);
    }
    ll s=x.size();ll num;
    rep(i,s)if(x[i]%n==tmp){
        num=i;
        break;
    }
    s--;
    //cout<<s<<" "<<num<<endl;
    int q;cin>>q;
    ll k;vll ans(q);
    rep(i,q){
        cin>>k;
        if(k<=num)ans[i]=x[k];
        else ans[i]=x[num]+((k-num)/(s-num))*(x[s]-x[num])+x[num+k%(s-num)]-x[num];
    }
    rep(i,q)cout<<ans[i]<<endl;
}