#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
typedef pair <int, int> pii;

inline int read() {
    int x = 0, f = 0;
    char c = getchar();
    while (!isdigit(c)) {if (c == '-') f = 1; c = getchar();}
    while (isdigit(c)) x = (x << 1) + (x << 3) + (c & 15), c = getchar();
    return f? -x : x;
}

const int MAXN = 300;
const int Mod = 1e9+7;
int l[MAXN + 10], r[MAXN + 10];
int DP(int n, int x) {
    static int dp[MAXN + 10][2][2];
    dp[0][0][0] = 1;
    int res = 1;
    for (int i = 1; i <= n; ++i) {
        int p1 = x - l[i], p2 = r[i] - x + 1;
        p1 = max(p1, 0ll); p1 = min(p1, r[i] - l[i] + 1);
        p2 = max(p2, 0ll); p2 = min(p2, r[i] - l[i] + 1);
        res = 1ll * res * (r[i] - l[i] + 1) % Mod;
        dp[i][0][0] = 1ll * (dp[i - 1][1][0] + dp[i - 1][0][0]) * p1 % Mod;
        dp[i][1][0] = 1ll * dp[i - 1][0][1] * p1 % Mod;
        dp[i][0][1] = 1ll * dp[i - 1][0][0] * p2 % Mod;
    }
    int sum = ((dp[n][0][0] + dp[n][0][1]) % Mod + dp[n][1][0]) % Mod;
    //assert(res >= sum);
    return (res - sum + Mod) % Mod;
}

inline int fastpow(int x, int p) {
    int ans = 1;
    while (p) {
        if (p & 1) ans = 1ll * ans * x % Mod;
        x = 1ll * x * x % Mod;
        p >>= 1;
    }
    return ans;
}
int Lan(int *X, int *Y, int n, int k) {
    int ans = 0;

    for (int i = 1; i <= n; ++i) {
        int res = 1, prod = 1;
        for (int j = 1; j <= n; ++j)
        {
            if(i == j) continue;
            prod = 1ll * prod * (X[i] - X[j]) % Mod, res = 1ll * res * (k - X[j]) % Mod;
        }
            
        
        if(prod < 0) prod += Mod;
        if(res < 0) res += Mod;
        prod = fastpow(prod, Mod - 2);
        ans = (ans + 1ll * res * Y[i] % Mod * prod ) % Mod;
    }
    if (ans < 0) ans += Mod;
    return ans;
}
signed main() {
    // freopen ("std.in", "r", stdin);
    // freopen ("std.out", "w", stdout);
    int T = read();
    while (T--) {
        int n = read();
        for (int i = 1; i <= n; ++i) l[i] = read();
        for (int i = 1; i <= n; ++i) r[i] = read();

        static int b[MAXN + 10], tot = 0;
        for (int i = 1; i <= n; ++i) b[++tot] = l[i];
        for (int i = 1; i <= n; ++i) b[++tot] = r[i] + 1;
        b[++tot] = 1;
        sort(b + 1, b + tot + 1);
        tot = unique(b + 1, b + tot + 1) - b - 1;
        int ans = 0;
        for (int i = 1; i < tot; ++i) {
            int L = b[i], R = b[i + 1] - 1;
            int len = min(R - L + 1, n + 2);
            static int X[MAXN + 10], Y[MAXN + 10];
            for (int j = 1; j <= len; ++j) {
                X[j] = L + j - 1;
                Y[j] = DP(n, X[j]);
            }
            for (int j = 2; j <= len; ++j) 
                Y[j] = (Y[j - 1] + Y[j]) % Mod;
            if (len == R - L + 1) {
                ans = (ans + Y[len]) % Mod;
            }
            else {
                ans = (ans + Lan(X, Y, len, R)) % Mod;
                ans = (ans + Mod) % Mod;
            }
        }
        cout << ans << endl;
    }
    return 0;
}