#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e9+7;

vector<int> solve(const vector<int>& c, const vector<int>& b, const vector<int>& x) {
  int n = c.size();
  int q = x.size();
  vector<int> cb(n);
  cb[0] = 0;
  for (int i = 0; i < n-1; ++i) {
    cb[i+1] = cb[i] + b[i];
  }
  vector<int> d(n);
  d[0] = 0;
  for (int i = 0; i < n-1; ++i) {
    d[i+1] = d[i] + cb[i+1];
  }
  int low = -1e8, high = 1e8;
  while (low < high) {
    int mid = high - (high - low) / 2;
    bool ok = true;
    for (int i = 0; ok && (i < n); ++i) {
      if ((d[i] + int64_t(i+1)*mid) > 0) {
	ok = false;
      }
    }
    if (ok) {
      low = mid;
    }
    else {
      high = mid-1;
    }
  }
  vector<int> cc(n+1);
  cc[0] = 0;
  for (int i = 0; i < n; ++i) {
    cc[i+1] = cc[i] + c[i];
  }
  int maxsum = cc[n];
  auto calc = [&](int xi) {
    vector<int> dp(maxsum+1, 1);
    vector<int> cs(maxsum+2);
    cs[0] = 0;
    for (int i = n-1; i >= 0; --i) {
      vector<int> dp2(maxsum+1, 0);
      for (int j = 0; j <= maxsum; ++j) {
	cs[j+1] = cs[j] + dp[j];
	if (cs[j+1] >= MOD) cs[j+1] -= MOD;
      }
      for (int j = 0; j <= cc[i]; ++j) {
	dp2[j] = cs[j+c[i]+1] + (MOD - cs[j+min(max(0, d[i]+(i+1)*xi - j), c[i]+1)]);
	if (dp2[j] >= MOD) dp2[j] -= MOD;
      }
      dp2.swap(dp);
    }
    return dp[0];
  };
  vector<int> r(1, calc(low));
  for (int i = low+1; r.back() > 0; ++i) {
    r.push_back(calc(i));
  }
  vector<int> ans(q);
  for (int qi = 0; qi < q; ++qi) {
    ans[qi] = r[min(max(x[qi]-low, 0), int(r.size())-1)];
  }
  return ans;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<int> c(n);
  for (int i = 0; i < n; ++i) {
    cin >> c[i];
  }
  vector<int> b(n-1);
  for (int i = 0; i < n-1; ++i) {
    cin >> b[i];
  }
  int q;
  cin >> q;
  vector<int> x(q);
  for (int i = 0; i < q; ++i) {
    cin >> x[i];
  }
  vector<int> solush = solve(c, b, x);
  for (int i = 0; i < q; ++i) {
    if (i > 0) cout << " ";
    cout << solush[i];
  }
  cout << endl;
}
