#include using namespace std; typedef long long int ll; typedef pair P; typedef vector VI; typedef vector VVI; const ll MOD = 1000000007; const ll INF = 4611686018427387903; #define REP(i, n) for (int i = 0; i < n; i++) #define ALL(v) v.begin(), v.end() int main(){ int n; cin >> n; VI a(n); REP(i,n) cin >> a[i]; VI f(n,-1), ans(0); ll now=0; ll rp=0, rs=0; for(int i=0;1;i++){ if(f[now%n]!=-1){ rp=i-f[now%n]; rs=f[now%n]; ans.push_back(now); break; } ans.push_back(now); f[now%n]=i; now+=a[now%n]; } ll d=ans[rp+rs]-ans[max((ll)0,rs-1)]; int q; cin >> q; ll k; while(q--){ cin >> k; if(k<=rs+rp) cout << ans[k] << endl; else cout << ans[rs+(k-rs)%rp]+d*((k-rs)/rp) << endl; } return 0; }