#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;
  vector<ll> A(N);
  rep(i,N) cin>>A[i];
  int Q;
  cin>>Q;
  vector<ll> K(Q);
  rep(i,Q) cin>>K[i];

  vector<int> used(N,0);
  vector<int> idxs;
  ll x=0;
  while(1){
    int r=x%N;
    if(used[r]) break;
    idxs.push_back(r);
    used[r]=1;
    x+=A[r];
  }

  int P=idxs.size();
  vector<ll> sum(P+1,0);
  int st=0;
  for(int i=0;i<P;i++){
    if(idxs[i]==x%N){
      st=i;
      break;
    }
  }
  int T=P-st;

  rep(i,P) sum[i+1]=sum[i]+A[idxs[i]];
  rep(q,Q){
    ll tar=K[q];
    if(tar<=st){
      cout<<sum[tar]<<"\n";
      continue;    
    }

    tar-=st;
    ll res=(sum[P]-sum[st])*(tar/T)+sum[st+tar%T];
    cout<<res<<"\n";
  }

  return 0;
}