#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=200+5,M=N*4+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,k=155,L[N],R[N],ns[N],nh;
ll dp[N][3];
int X[N];ll Y[N];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
ll calc(int l,int r,int x){
	ll tot=0;
	for(int i=l;i<=r;i++) (Y[i]+=Y[i-1])%=mod;
	for(int i=l;i<=r;i++){
		ll w=Y[i],pw=1;
		for(int j=l;j<=r;j++) if(i^j) w=w*(x+mod-X[j])%mod,pw=pw*(X[i]+mod-X[j])%mod;
		tot+=w*mpow(pw)%mod;
	}
	return tot%mod;
}
void Solve(){
	scanf("%d",&n);
	ns[nh=1]=1;
	for(int i=1;i<=n;i++) scanf("%d",&L[i]),ns[++nh]=L[i];
	for(int i=1;i<=n;i++) scanf("%d",&R[i]),ns[++nh]=R[i]+1;
	ll mul=1;
	for(int i=1;i<=n;i++) (mul*=R[i]-L[i]+1)%=mod;
	sort(ns+1,ns+nh+1);
	ll ans=0;
	for(int i=1;i<nh;i++){
		int l=ns[i],r=ns[i+1]-1;
		for(int i=l;i<=r&&i<l+k;i++){
			Me(dp,0);dp[0][0]=1;
			for(int j=1;j<=n;j++){
				ll w0=min(max(L[j],i),R[j]+1)-L[j],w1=R[j]-L[j]+1-w0;
				dp[j][0]=(dp[j-1][0]*w0+dp[j-1][2]*w0)%mod;
				dp[j][1]=dp[j-1][0]*w1%mod;
				dp[j][2]=dp[j-1][1]*w0%mod;
			}
			X[i-l+1]=i;Y[i-l+1]=mul+mod-(dp[n][0]+dp[n][1]+dp[n][2])%mod;
		}
		ans+=calc(1,min(k,r-l+1),r);
	}
	printf("%lld\n",ans%mod);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}