#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9+7, N = 100, A = 100;
int n, q, b[N], c[N], sol[A+1], dp[2][N*A+1];

void add(int & x, int y) {
    x += y;
    if(x >= MOD) x -= MOD;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) cin >> c[i];
    for (int i = 0; i < n-1; i++) cin >> b[i];
    int minx = 0, sum = 0, act = 0;
    for (int k = 2; k <= n; k++) {
        act += b[k-2];
        sum -= act;
        minx = min(minx, sum/k);
    }
    for (int x = minx; x <= minx+A; x++) {
        dp[1][0] = 1;
        for (int s = 1; s <= N*A; s++) dp[1][s] = 0;
        int lb = x, act = x;
        for (int i = 0; i < n; i++) {
            dp[i&1][0] = dp[(i&1)^1][0];
            for (int s = 1; s <= N*A; s++) {
                dp[i&1][s] = dp[i&1][s-1];
                add(dp[i&1][s], dp[(i&1)^1][s]);
                if(s > c[i]) add(dp[i&1][s], MOD-dp[(i&1)^1][s-c[i]-1]);
            }
            for (int s = 0; s < min(lb, N*A+1); s++) dp[i&1][s] = 0;
            if(i+1 < n) {
                act += b[i];
                lb += act;
            }
        }
        for (int s = 0; s <= N*A; s++) add(sol[x-minx], dp[(n-1)&1][s]);
    }
    long long all = 1;
    for (int i = 0; i < n; i++) all = all * (c[i]+1) % MOD;

    cin >> q;
    while(q--) {
        int x; cin >> x;
        cout << (x < minx ? all : (x > minx + A ? 0 : sol[x-minx])) << "\n";
    }
    return 0;
}
