Problem: This is the easy version of the problem. The only difference is that in this version q = 1. You can make hacks only if both versions of the problem are solved.

There is a process that takes place on arrays a and b of length n and length n-1 respectively. 

The process is an infinite sequence of operations. Each operation is as follows: 

  * First, choose a random integer i (1 ≤ i ≤ n-1). 
  * Then, simultaneously set a_i = min\left(a_i, \frac{a_i+a_{i+1}-b_i}{2}\right) and a_{i+1} = max\left(a_{i+1}, \frac{a_i+a_{i+1}+b_i}{2}\right) without any rounding (so values may become non-integer). 

See notes for an example of an operation.

It can be proven that array a converges, i. e. for each i there exists a limit a_i converges to. Let function F(a, b) return the value a_1 converges to after a process on a and b.

You are given array b, but not array a. However, you are given a third array c. Array a is good if it contains only integers and satisfies 0 ≤ a_i ≤ c_i for 1 ≤ i ≤ n.

Your task is to count the number of good arrays a where F(a, b) ≥ x for q values of x. Since the number of arrays can be very large, print it modulo 10^9+7.

Input

The first line contains a single integer n (2 ≤ n ≤ 100).

The second line contains n integers c_1, c_2 …, c_n (0 ≤ c_i ≤ 100).

The third line contains n-1 integers b_1, b_2, …, b_{n-1} (0 ≤ b_i ≤ 100).

The fourth line contains a single integer q (q=1).

The fifth line contains q space separated integers x_1, x_2, …, x_q (-10^5 ≤ x_i ≤ 10^5).

Output

Output q integers, where the i-th integer is the answer to the i-th query, i. e. the number of good arrays a where F(a, b) ≥ x_i modulo 10^9+7.

Example

Input


3
2 3 4
2 1
1
-1


Output


56

Note

The following explanation assumes b = [2, 1] and c=[2, 3, 4] (as in the sample).

Examples of arrays a that are not good: 

  * a = [3, 2, 3] is not good because a_1 > c_1; 
  * a = [0, -1, 3] is not good because a_2 < 0. 



One possible good array a is [0, 2, 4]. We can show that no operation has any effect on this array, so F(a, b) = a_1 = 0.

Another possible good array a is [0, 1, 4]. In a single operation with i = 1, we set a_1 = min((0+1-2)/(2), 0) and a_2 = max((0+1+2)/(2), 1). So, after a single operation with i = 1, a becomes equal to [-1/2, 3/2, 4]. We can show that no operation has any effect on this array, so F(a, b) = -1/2.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define RANGE(x) x.begin(),x.end()
void one(){
  
}
int main(){
  std::ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin>>n;
  vector<int> b(n-1);
  vector<int> c(n);
  ll allways= 1;
  for(int i=0;i<n;++i){
    cin>>c[i];
    allways*=c[i];
    allways%=mod;
  }
  for(int i=1;i<n;++i){
    cin>>b[i-1];
  }
  int Q;
  cin>>Q;
  vector<int> bbars(n);
  vector<int> bpre(n);
  bpre[0]=0;
  bbars[0]=0;
  for(int i=1;i<n;++i){
    bpre[i]=bpre[i-1]+b[i-1];
    bbars[i]=bbars[i-1]+bpre[i];
  }
  while(Q-->0){
    int x;
    cin>>x;
    ll offset = 0;
    ll failures = 0;
    vector<ll> curr(1,1);
    for(int k=0; k<n;++k){
      int os = curr.size();
      vector<ll> temp(os+c[k]);
      ll val = 0;
      for(int i=0;i<temp.size();++i){
        if(i>=c[k]+1)val-=curr[i-c[k]-1];
        if(i<os)val+=curr[i];
        temp[i] = val%mod;
      }
      // check if i>0;
      int min =bbars[k] + (k+1)*x;
      if(offset<min){
        curr.clear();
        if(min-offset<temp.size()){
          curr.insert(curr.end(),temp.begin() + min-offset,temp.end());
          offset = min;
        }
      }
      else{
        swap(temp,curr);
      }
    }
    ll res = 0;
    for(ll i:curr){
      res+=i;
    }
    cout<<res%mod<<endl;
  }
  cout<<flush;
}