#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;

void solve()
{
	int n;
	cin>>n;
	vector<ll>a(n);
	rep(i,n)cin>>a[i];
	ll x=0;
	vector<ll>used(n,-1);
	vector<ll>v;
	ll cnt=0;
	ll loop=0;
	ll start=0;
	v.eb(0);
	while(1){
		x=x+a[x%n];
		if(used[x%n]==-1)used[x%n]=cnt,v.eb(x);
		else {
			loop=cnt-used[x%n];
			start=cnt+1;
			break;
		}
		++cnt;
	}
	vector<ll>pre(start+1);
	rep(i,start){
		pre[i+1]=pre[i]+a[v[i]%n];
	}
	//cout<<loop<<endl;
	// rep(i,start+1){
	// 	cout<<pre[i]<<"\n";
	// }
	vector<ll>val(loop+1);
	rep(i,loop){
		val[i+1]=val[i]+a[v[start-loop+i]%n];
	}
	//rep(i,loop+1)cout<<val[i]<<endl;
	int q;
	cin>>q;
	while(q--){
		ll k;
		cin>>k;
		if(k<=start){
			cout<<pre[k]<<"\n";
		}
		else{
			ll x=(k-start)/loop*val.back();
			x+=val[(k-start+loop)%loop];
			x+=pre.back();
			cout<<x<<"\n";
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}