#include <bits/stdc++.h>
//#include <atcoder/all>
#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()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
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;
//using namespace atcoder;


void solve(){
	ll n;
	cin>>n;
	vector<ll>a(n+1);
	rep(i,n)cin>>a[i+1];
	int cur=1;
	ll x=0;
	ll loop,start;
	vector<ll>sum(n+5),used(n+5);
	for(ll i=1;i<=n+5;++i){
		x+=a[cur];
		sum[i]=x;
		cur=x%n+1;

		if(used[cur]>0){
			loop=i-used[cur];
			start=used[cur];
			break;
		}
		used[cur]=i;
	}

	int q;
	cin>>q;
	while(q--){
		x=0;
		ll k;
		cin>>k;
		if(k<start){
			x+=sum[k];
			cout<<x<<"\n";
			continue;
		}
		ll len=(k-start)/loop;
		x+=len*(sum[start+loop]-sum[start]);
		k-=len*loop;
		x+=sum[k];
		cout<<x<<"\n";
	}
}


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