#include <bits/stdc++.h>

using namespace std;

const int P = 1e9 + 7;

inline int mod (int x) { return x + (x >> 31 & P); }
inline void pls(int &x, int y) { x = mod (x + y - P); }
inline int power (int x, int k) {
	int res = 1;
	while (k) {
		if (k & 1) res = 1ll * res * x % P;
		x = 1ll * x * x % P;
		k >>= 1;
	}
	return res;
}

#define lep(i, l, r) for (int i = (l); i <= (r); i ++) 
#define rep(i, l, r) for (int i = (l); i >= (r); i --)

const int N = 150 + 5;

int n, L[N], R[N];

int f[N][3];

int getC(int x) {
	f[0][0] = 1; f[0][1] = f[0][2] = 0;
	for (int i = 1; i <= n; i ++) {
		f[i][0] = f[i][1] = f[i][2] = 0;
		
		int le = max(x - L[i], 0); le = min (le, R[i] - L[i]);
		int ri = max(R[i] - x, 0); ri = min (ri, R[i] - L[i]);
		assert (le + ri == R[i] - L[i]);

		pls (f[i][0], 1ll * (f[i - 1][0] + f[i - 1][2]) * le % P);
		pls (f[i][1], 1ll * (f[i - 1][0]) * ri % P);
		pls (f[i][2], 1ll * f[i - 1][1] * le % P);
	}
	int ans = 0;
	lep (i, 0, 2) pls (ans, f[n][i]);
	int mul = 1;
	lep (i, 1, n) mul = 1ll * mul * (R[i] - L[i]) % P;
	//cerr << x << ' ' << ans << ' ' << mul << endl;
	ans = (mul - ans + P) % P;
	return ans;
}

int brute(int l, int r) {
	int ans = 0;
	lep (i, l, r) pls (ans, getC(i));
	return ans;
}

struct Lag {
	int X[N], Y[N], fac[N * N], inv[N * N], tmp[N * N];
	int id[N][N];
	void getinv() {
		int tot = 0;
		lep (i, 1, n + 2) lep (j, 1, n + 2) if (i != j) id[i][j] = ++ tot, fac[tot] = (X[i] - X[j] + P) % P, tmp[tot] = fac[tot],  inv[tot] = 0;
		fac[0] = 1; tmp[0] = 1;
		lep (i, 1, tot) fac[i] = 1ll * fac[i] * fac[i - 1] % P;
		inv[tot] = power (fac[tot], P - 2);
		rep (i, tot - 1, 0) inv[i] = 1ll * inv[i + 1] * tmp[i + 1] % P;
		lep (i, 1, tot) inv[i] = 1ll * inv[i] * fac[i - 1] % P;
	}
	int get(int x) {
		int ans = 0;
		for (int i = 1; i <= n + 2; i ++) {
			int mul = 1;
			for (int j = 1; j <= n + 2; j ++) if (i != j) {
				mul = 1ll * mul * (x - X[j] + P) % P;
				mul = 1ll * mul * inv[id[i][j]] % P;
			}
			mul = 1ll * mul * Y[i] % P;
			pls (ans, mul);
		}
		return ans;
	}
} lag;

int calc (int l, int r) {
	if (r - l + 1 <= n + 2) return brute(l, r);
	
	for (int i = 1; i <= n + 2; i ++) {
		lag.X[i] = l + i - 1;
		lag.Y[i] = getC(l + i - 1);
		pls (lag.Y[i], lag.Y[i - 1]);
	}
	lag.getinv();
	return lag.get(r);
}

void solve() {
	cin >> n;
	vector<int> p;
	lep (i, 1, n) cin >> L[i], p.push_back (L[i]);
	lep (i, 1, n) cin >> R[i], ++ R[i], p.push_back (R[i]);
	p.push_back (1);
	p.push_back (1e9 + 1);
	sort (p.begin(), p.end());
	p.erase (unique (p.begin(), p.end()), p.end());
	int ans = 0;
	for (int x : p) pls (ans, getC(x));
	for (int i = 0; i + 1 < (int) p.size(); i ++) {
		int l = p[i] + 1, r = p[i + 1] - 1;
		if (l > r) continue;
		pls (ans, calc(l, r));
	}
	cout << ans << '\n';
}

int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int Case;
	cin >> Case;
	while (Case --) solve();
	return 0;
}