#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 505;
const int MOD = 1e9 + 7;
ll L[MAXN],R[MAXN],x[MAXN],X[MAXN],Y[MAXN],f[MAXN][2][2];
int n;
ll qpw(ll x,ll b)
{
    ll ans = 1;
    while(b)
    {
        if(b&1) ans = ans * x %MOD;
        x = x * x % MOD;
        b >>= 1;
    }
    return ans;
}
ll Lag(ll *X,ll *Y,ll o,int n)
{
    ll ans=0;
    for(int i = 1; i <= n; ++i)
    {
        ll fz = 1,fm = 1;
        for(int j = 1; j <= n; ++j)
        {
            if(i==j) continue;
            fz = fz * (o - X[j]) % MOD;
            fm = fm * (X[i] - X[j]) % MOD;
        }
        if(fz < 0) fz += MOD;
        if(fm < 0) fm += MOD;
        ans = (ans + fz * qpw(fm,MOD-2) % MOD * Y[i] % MOD) %MOD;
    }
    return ans;
}
ll DP(ll x)
{
    ll sum = 1;
    f[0][0][0]=1;
    for(int i = 1; i <= n; ++i)
    {
        sum = sum * (R[i] - L[i] + 1) % MOD;
        f[i][0][0] = (f[i-1][1][0] + f[i-1][0][0]) * (x > L[i]?min(R[i]+1,x) - L[i] :0) % MOD;
        f[i][1][0] = f[i-1][0][1] * (x > L[i]?min(x,R[i]+1) - L[i]:0) % MOD;
        f[i][0][1] = f[i-1][0][0] * (x <= R[i]?R[i] - max(x,L[i]) + 1:0) % MOD;
     }
     return ((sum - f[n][0][0] - f[n][0][1] - f[n][1][0]) % MOD + MOD) % MOD;
}
int main()
{
    int T;scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i = 1; i <= n; ++i) scanf("%lld",&L[i]);
        for(int i = 1; i <= n; ++i) scanf("%lld",&R[i]);
        for(int i = 1; i <= n; ++i)
        {
            x[i] = L[i];
            x[i + n] = R[i];
        }
        int tot = 2 * n;
        x[++tot] = 1;x[++tot] = 1e9+1;
        sort(x+1,x+1+tot);
        tot = unique(x+1,x+1+tot) - x - 1;

        // cout<<"x:"<<endl;
        // for(int i = 1; i <= tot; ++i) cout<<x[i]<<" ";
        // cout<<endl;
        // cout<<"DP:"<<endl;
        // cout<<DP(1)<<" "<<DP(2)<<" "<<DP(3)<<endl;

        ll ans = 0;
        for(int i = 1; i <= tot; ++i)
        {
            int j = min(i + 200ll,x[i+1]);
            for(int k = x[i]; k < j; ++k)
            {
                X[k - x[i] + 1] = k;
                Y[k - x[i] + 1] = DP(k);
            }
            if(j < x[i+1])
            {
                for(int k = x[i]; k < j; ++k)
                    Y[k - x[i] + 1] = (Y[k - x[i] + 1] + Y[k - x[i]]) % MOD;
                ans = (ans + Lag(X,Y,x[i+1] - 1,j - i));
            }
            else
            {
                for(int k = x[i]; k < j; ++k)
                    ans = (ans + Y[k - x[i] + 1]) % MOD;
            }
        }
        printf("%lld\n",ans);
    }
    return 0;
}