#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef vector vl; typedef vector vvl; typedef vector vc; typedef vector vs; typedef vector vb; typedef vector vd; typedef pair P; typedef pair pii; typedef vector

vpl; typedef tuple tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = 1<<30; const ll linf = 1LL<<62; const int MAX = 510000; ll dy[8] = {1,-1,0,0,1,-1,1,-1}; ll dx[8] = {0,0,1,-1,1,-1,-1,1}; const double pi = acos(-1); const double eps = 1e-7; template inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template inline bool chmax(T1 &a,T2 b){ if(a inline void print(T &a){ rep(i,a.size()) cout << a[i] << " "; cout << "\n"; } template inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";} template inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } const int mod = 1e9 + 7; //const int mod = 998244353; ll sum[50][101010]; ll amari[50][101010]; int main(){ ll n; cin >> n; vl a(n); rep(i,n) cin >> a[i]; rep(i,n){ sum[0][i] = a[i]; amari[0][i] = (i + a[i]) % n; } rep(i,45){ rep(j,n){ sum[i+1][j] += sum[i][j] + sum[i][amari[i][j]]; amari[i+1][j] = amari[i][amari[i][j]]; } } ll q; cin >> q; while(q--){ ll k; cin >> k; ll ans = 0; rep(i,45){ if(k>>i & 1) ans += sum[i][0]; } cout << ans << "\n"; } }