#include <bits/stdc++.h>

using namespace std;

std::string to_string(std::string s) { return '"' + s + '"'; }

std::string to_string(const char* s) { return to_string((std::string)s); }

std::string to_string(bool b) { return (b ? "true" : "false"); }

template <typename A, typename B>
std::string to_string(std::pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
std::string to_string(A v) {
  using ::to_string;
  using std::to_string;
  bool first = true;
  std::string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() { std::cerr << std::endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  using ::to_string;
  using std::to_string;
  std::cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...)					\
  std::cerr << __FUNCTION__ << "(" << __LINE__ << ")"	\
  << "[" << #__VA_ARGS__ << "]:",			\
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int mod = 1e9 + 7;

inline int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }

inline int sub(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }

inline int mul(int a, int b) { return (int)((long long)a * b % mod); }


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n;
  cin >> n;
  vector<int> c(n);
  for (int i = 0; i < n; ++i) {
    cin >> c[i];
  }
  vector<int> b(n);
  for (int i = 1; i < n; ++i) {
    cin >> b[i];
  }

  for (int i = 1; i < n; ++i) {
    b[i] += b[i - 1];
  }
  for (int i = 1; i < n; ++i) {
    b[i] += b[i - 1];
  }
  int sum = 0;
  for (int i = 0; i < n; ++i) {
    sum += c[i];
  }

  int q;
  cin >> q;
  map<int, int> ans;
  while (q--) {
    int x;
    cin >> x;
    if (ans.find(x) != ans.end()) {
      cout << ans[x] << endl;
      continue;
    }
    int t_sum = 0;
    bool ok = true;
    for (int i = 0; i < n; ++i) {
      t_sum += c[i];
      if (t_sum < x * (i + 1) + b[i]) {
	ok = false;
	break;
      }
    }
    if (!ok) {
      cout << 0 << endl;
      continue;
    }
    ok = true;
    for (int i = 0; i < n; ++i) {
      if (x * (i + 1) + b[i] > 0) {
	ok = false;
	break;
      }
    }
    if (ok) {
      int p = 1;
      for (int i = 0; i < n; ++i) {
	p = mul(p, c[i] + 1);
      }
      cout << p << endl;
      continue;
    }
    vector<int> f[2];
    f[0].resize(sum + 1);
    f[1].resize(sum + 1);
    int now = 0;
    int pre = 1;
    int l = max(0, x);
    int r = c[0];
    for (int k = l; k <= r; ++k) {
      f[now][k] = 1;
    }
    for (int k = l + 1; k <= sum; ++k) {
      f[now][k] = add(f[now][k], f[now][k - 1]);
    }
    for (int i = 1; i < n; ++i) {
      now ^= 1;
      pre ^= 1;
      fill(f[now].begin(), f[now].end(), 0);
      int l = max(0, x * (i + 1) + b[i]);
      int r = sum;
      for (int k = l; k <= r; ++k) {
	int vl = k - c[i] <= 0 ? 0 : f[pre][k - c[i] - 1];
	int vr = f[pre][k];
	f[now][k] = sub(vr, vl);
      }
      for (int k = l + 1; k <= sum; ++k) {
	f[now][k] = add(f[now][k], f[now][k - 1]);
      }
    }
    ans[x] = f[now][sum];
    cout << ans[x] << endl;
  }
  return 0;
		 
}
