#include #define rep(i,n) for (int i = 0; i < (int)(n); i ++) #define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i) using namespace std; using ll = long long; using PL = pair; using P = pair; constexpr int INF = 1000000000; constexpr long long HINF = 1000000000000000; constexpr long long MOD = 1000000007;// = 998244353; constexpr double EPS = 1e-4; constexpr double PI = 3.14159265358979; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int N; cin >> N; vector A(N); rep(i,N) cin >> A[i]; vector> go(N,vector(50)); vector> val(N,vector(50)); rep(i,N) { go[i][0] = (i + A[i])%N; val[i][0] = A[i]; } rep(i,49) { rep(j,N) { go[j][i + 1] = go[go[j][i]][i]; val[j][i + 1] = val[j][i] + val[go[j][i]][i]; } } int Q; cin >> Q; rep(i,Q) { ll K; cin >> K; ll ret = 0; int x = 0; rep(j,50) { if ((K>>j)&1) { ret += val[x][j]; x = go[x][j]; } } cout << ret << '\n'; } return 0; }