Problem: When Petya has free from computer games time, he attends university classes. Every day the lessons on Petya’s faculty consist of two double classes. The floor where the lessons take place is a long corridor with M classrooms numbered from 1 to M, situated along it.

All the students of Petya’s year are divided into N groups. Petya has noticed recently that these groups’ timetable has the following peculiarity: the number of the classroom where the first lesson of a group takes place does not exceed the number of the classroom where the second lesson of this group takes place. 

Once Petya decided to count the number of ways in which one can make a lesson timetable for all these groups. The timetable is a set of 2N numbers: for each group the number of the rooms where the first and the second lessons take place. Unfortunately, he quickly lost the track of his calculations and decided to count only the timetables that satisfy the following conditions:

1) On the first lesson in classroom i exactly Xi groups must be present.

2) In classroom i no more than Yi groups may be placed.

Help Petya count the number of timetables satisfying all those conditionsю As there can be a lot of such timetables, output modulo 109 + 7.

Input

The first line contains one integer M (1 ≤ M ≤ 100) — the number of classrooms.

The second line contains M space-separated integers — Xi (0 ≤ Xi ≤ 100) the amount of groups present in classroom i during the first lesson.

The third line contains M space-separated integers — Yi (0 ≤ Yi ≤ 100) the maximal amount of groups that can be present in classroom i at the same time.

It is guaranteed that all the Xi ≤ Yi, and that the sum of all the Xi is positive and does not exceed 1000.

Output

In the single line output the answer to the problem modulo 109 + 7.

Examples

Input

3
1 1 1
1 2 3


Output

36


Input

3
1 1 1
1 1 1


Output

6

Note

In the second sample test the first and the second lessons of each group must take place in the same classroom, that’s why the timetables will only be different in the rearrangement of the classrooms’ numbers for each group, e.g. 3! = 6.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline long long getint() {
  long long _x = 0, _tmp = 1;
  char _tc = getchar();
  while ((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();
  if (_tc == '-') _tc = getchar(), _tmp = -1;
  while (_tc >= '0' && _tc <= '9') _x *= 10, _x += (_tc - '0'), _tc = getchar();
  return _x * _tmp;
}
long long mypow(long long _a, long long _x, long long _mod) {
  if (_x == 0) return 1ll;
  long long _tmp = mypow(_a, _x / 2, _mod);
  _tmp = (_tmp * _tmp) % _mod;
  if (_x & 1) _tmp = (_tmp * _a) % _mod;
  return _tmp;
}
inline long long add(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x + _y;
  if (_ >= _mod) _ -= _mod;
  return _;
}
inline long long sub(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x - _y;
  if (_ < 0) _ += _mod;
  return _;
}
inline long long mul(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x * _y;
  if (_ >= _mod) _ %= _mod;
  return _;
}
inline bool equal(double _x, double _y) {
  return _x > _y - 1e-9 && _x < _y + 1e-9;
}
int __ = 1, _cs;
long long n, x[1021], y[1021], s[1021];
long long C[1021][1021], lvl[1021];
void build() {
  for (long long i = 0; i < 1021; i++) C[i][0] = C[i][i] = 1;
  for (long long i = 2; i < 1021; i++)
    for (long long j = 1; j < i; j++)
      C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]);
}
void init() {
  n = getint();
  for (int i = 1; i <= n; i++) {
    x[i] = getint();
    s[i] = s[i - 1] + x[i];
  }
  for (int i = 1; i <= n; i++) y[i] = getint();
}
long long dp[1021][1021];
void solve() {
  dp[0][0] = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= s[i]; j++)
      if (dp[i][j]) {
        long long pp = j + x[i + 1];
        long long bdr = min(pp, y[i + 1]);
        for (int k = 0; k <= bdr; k++)
          dp[i + 1][pp - k] = add(dp[i + 1][pp - k], mul(dp[i][j], C[pp][k]));
      }
  long long all = s[n], ans = dp[n][0];
  for (int i = 1; i <= n; i++) {
    ans = mul(ans, C[all][x[i]]);
    all -= x[i];
  }
  cout << ans << endl;
}
int main() {
  build();
  while (__--) {
    init();
    solve();
  }
}