#include <bits/stdc++.h>
#define BPhuong "main"
#define maxn 109
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define ll long long
#define bit(i, j) ((i >> j) & 1)
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back

using namespace std;
int n, q, c[maxn], b[maxn];
int dp[maxn][maxn * maxn], ans[200008], F[maxn * maxn];
const int mod = 1e9 + 7;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    #ifndef ONLINE_JUDGE
    freopen(BPhuong ".inp", "r", stdin);
    freopen(BPhuong ".out", "w", stdout);
    #endif // ONLINE_JUDGE
    cin >> n;
    ll gt = 1;
    fi(i, 1, n){
        int u;
        cin >> u;
        c[i] = c[i - 1] + u;
        gt = gt * (u + 1) % mod;
    }
    c[n + 1] = c[n];
    fi(i, 1, n - 1){
        int u;
        cin >> u;
        b[i] = b[i - 1] + u;
    }
    fi(i, 2, n - 1) b[i] += b[i - 1];
    fi(t, -100000, 100000){
        if(t * n + b[n - 1] <= 0) {
                ans[t + 100000] = gt;
                continue;
        }
        if(n * t + b[n - 1] > c[n]) {
                ans[t + 100000] = 0;
                continue;
        }
        fi(i, 1, n)
            fi(j, 0, 10000) dp[i][j] = 0;
        fi(i, max(0, t), c[1]) dp[1][i] = 1;
        fi(j, 1, c[1 + 1])
                dp[1][j] = (dp[1][j] + dp[1][j - 1]) % mod;
        fi(i, 2, n){
            fi(j, max(t * i + b[i - 1], 0), c[i])
                if(j - c[i] + c[i - 1] - 1 >= 0)
                    dp[i][j] = (dp[i - 1][j] - dp[i - 1][j - c[i] + c[i - 1] - 1] + mod) % mod;
                else dp[i][j] = dp[i - 1][j];
            fi(j, 1, c[i + 1])
                dp[i][j] = (dp[i][j] + dp[i][j - 1]) % mod;
        }
        ans[t + 100000] = dp[n][c[n]];
    }
    cin >> q;
    while(q--){
        int x;
        cin >> x;
        cout << ans[x + 100000] << '\n';
    }

}
