#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int A[101010];
int P[101010];
ll V[101010];
int Q;
ll K;
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>A[i];
	MINUS(P);
	P[0]=0;
	ll fir,per,dif;
	for(i=1;i<=N;i++) {
		V[i]=V[i-1]+A[V[i-1]%N];
		if(P[V[i]%N]==-1) {
			P[V[i]%N]=i;
		}
		else {
			fir=P[V[i]%N];
			per=i-fir;
			dif=V[i]-V[fir];
		}
	}
	cin>>Q;
	while(Q--) {
		cin>>K;
		if(K>=fir) {
			ll lp=(K-fir)/per;
			ll mo=(K-fir)%per;
			cout<<V[fir+mo]+lp*dif<<endl;
		}
		else {
			cout<<V[K]<<endl;
		}
	}
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}