#include <bits/stdc++.h>
using namespace std;
template <const int32_t MOD>
struct ModInt {
  int32_t x;
  ModInt() : x(0) {}
  ModInt(long long u) : x(u) {
    x %= MOD;
    if (x < 0) x += MOD;
  }
  friend bool operator==(const ModInt &a, const ModInt &b) {
    return a.x == b.x;
  }
  friend bool operator!=(const ModInt &a, const ModInt &b) {
    return a.x != b.x;
  }
  friend bool operator<(const ModInt &a, const ModInt &b) { return a.x < b.x; }
  friend bool operator>(const ModInt &a, const ModInt &b) { return a.x > b.x; }
  friend bool operator<=(const ModInt &a, const ModInt &b) {
    return a.x <= b.x;
  }
  friend bool operator>=(const ModInt &a, const ModInt &b) {
    return a.x >= b.x;
  }
  static ModInt sign(long long k) {
    return ((k & 1) ? ModInt(MOD - 1) : ModInt(1));
  }
  ModInt &operator+=(const ModInt &m) {
    x += m.x;
    if (x >= MOD) x -= MOD;
    return *this;
  }
  ModInt &operator-=(const ModInt &m) {
    x -= m.x;
    if (x < 0LL) x += MOD;
    return *this;
  }
  ModInt &operator*=(const ModInt &m) {
    x = (1LL * x * m.x) % MOD;
    return *this;
  }
  friend ModInt operator-(const ModInt &a) {
    ModInt res(a);
    if (res.x) res.x = MOD - res.x;
    return res;
  }
  friend ModInt operator+(const ModInt &a, const ModInt &b) {
    return ModInt(a) += ModInt(b);
  }
  friend ModInt operator-(const ModInt &a, const ModInt &b) {
    return ModInt(a) -= ModInt(b);
  }
  friend ModInt operator*(const ModInt &a, const ModInt &b) {
    return ModInt(a) *= ModInt(b);
  }
  static long long fp(long long u, long long k) {
    long long res = 1LL;
    while (k > 0LL) {
      if (k & 1LL) res = (res * u) % MOD;
      u = (u * u) % MOD;
      k /= 2LL;
    }
    return res;
  }
  static constexpr long long mod() { return MOD; }
  ModInt fastpow(long long k) { return ModInt(fp(x, k)); }
  ModInt inv() {
    assert(x);
    return ModInt(fp(x, MOD - 2));
  }
  ModInt &operator/=(const ModInt &m) { return *this *= ModInt(m).inv(); }
  friend ModInt operator/(const ModInt &a, const ModInt &b) {
    return ModInt(a) *= ModInt(b).inv();
  }
  friend ostream &operator<<(ostream &out, const ModInt &a) {
    return out << a.x;
  }
  friend istream &operator>>(istream &in, ModInt &a) { return in >> a.x; }
};
const long long MOD = 998244353;
using Mint = ModInt<MOD>;
const long long MAXSUM = 1e4 + 1;
const long long MAXN = 101;
Mint ways[MAXN][MAXSUM];
signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n;
  cin >> n;
  vector<long long> c(n);
  vector<long long> b(n - 1);
  for (long long i = 0; i < n; ++i) cin >> c[i];
  for (long long i = 0; i < n - 1; ++i) cin >> b[i];
  vector<long long> partialB(n);
  for (long long k0 = 0; k0 < n; ++k0)
    for (long long i = 0; i < k0; ++i) partialB[k0] += (k0 - i) * b[i];
  long long q;
  cin >> q;
  long long x;
  cin >> x;
  ways[0][0] = 1;
  for (long long nbPris = 1; nbPris <= n; ++nbPris)
    for (long long curSum = 0; curSum < MAXSUM; ++curSum) {
      if (curSum < (nbPris)*x + partialB[nbPris - 1]) continue;
      for (long long v = 0; v <= c[nbPris - 1] and v <= curSum; ++v)
        ways[nbPris][curSum] += ways[nbPris - 1][curSum - v];
    }
  Mint sol = 0;
  for (long long sum = 0; sum < MAXSUM; ++sum) sol += ways[n][sum];
  cout << sol << endl;
}
