#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  ll N;
  cin >> N;
  ll A[N];
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }

  ll memo[N + 1][41];
  for (int x = 0; x < N; ++x) {
    int r = x % N;
    memo[x][0] = x + A[r];
  }

  for (int step = 1; step <= 40; ++step) {
    for (int i = 0; i < N; ++i) {
      ll x = memo[i][step - 1];
      ll d = x / N;
      ll r = x % N;
      memo[i][step] = d * N + memo[r][step - 1];
    }
  }

  int Q;
  cin >> Q;
  for (int i = 0; i < Q; ++i) {
    ll k;
    cin >> k;
    ll X = 0;

    for (int d = 0; d < 40; ++d) {
      if (k >> d & 1) {
        ll v = X / N;
        ll r = X % N;
        X = v * N + memo[r][d];
      }
    }

    cout << X << endl;
  }

  return 0;
}