#include <bits/stdc++.h>
using namespace std;
constexpr int N = 300 + 5;
constexpr int mod = 1e9 + 7;
typedef long long ll;
int n, L[N], R[N];
int p[N], tot;
int m;
ll Y[N];
ll fac[N], ifac[N];
inline ll quickpow(ll a, int b)
{
	ll res = 1;
	while (b)
	{
		if (b & 1)
			(res *= a) %= mod;
		(a *= a) %= mod;
		b >>= 1;
	}
	return res;
}
inline void init(int _n)
{
	fac[0] = 1;
	for (int i = 1; i <= _n; ++i)
		fac[i] = fac[i - 1] * i % mod;
	ifac[_n] = quickpow(fac[_n], mod - 2);
	for (int i = _n; i >= 1; --i)
		ifac[i - 1] = ifac[i] * i % mod;
}
ll pre[N], suf[N];
inline auto lagrange(int x)
{
	pre[0] = 1;
	for (int i = 1; i <= m; ++i)
		pre[i] = pre[i - 1] * (x - i) % mod;
	suf[m + 1] = 1;
	for (int i = m; i >= 1; --i)
		suf[i] = suf[i + 1] * (x - i) % mod;
	ll res = 0;
	for (int i = 1; i <= m; ++i)
		(res += Y[i] * (pre[i - 1] * suf[i + 1] % mod) % mod * (((m - i) & 1 ? -1 : 1) * ifac[i - 1] * ifac[m - i] % mod)) %= mod;
	return res;
}
ll dp[N][4];
inline auto solve(int mid)
{
	dp[0][2] = 1;
	for (int i = 1; i <= n; ++i)
	{
		int x = max(R[i] - max(L[i], mid), 0), y = (R[i] - L[i]) - x;
		dp[i][0] = dp[i - 1][2] * x % mod;
		dp[i][1] = dp[i - 1][0] * y % mod;
		dp[i][2] = (dp[i - 1][1] + dp[i - 1][2]) * y % mod;
		dp[i][3] = (dp[i - 1][3] * (x + y) % mod + (dp[i - 1][0] + dp[i - 1][1]) * x % mod) % mod;
	}
	return dp[n][3];
}
inline void _main()
{
	cin >> n;
	for (int i = 1; i <= n; ++i)
		cin >> L[i];
	for (int i = 1; i <= n; ++i)
	{
		cin >> R[i];
		++R[i];
	}
	p[++tot] = 1;
	for (int i = 1; i <= n; ++i)
	{	
		p[++tot] = L[i];
		p[++tot] = R[i];
	}
	sort(p + 1, p + 1 + tot);
	tot = (int)(unique(p + 1, p + 1 + tot) - p - 1);
	ll ans = 0;
	for (int i = 1; i < tot; ++i)
	{
		if (p[i + 1] - p[i] > n + 2)
		{
			m = n + 2;
			for (int j = p[i]; j < p[i] + n + 2; ++j)
				Y[j - p[i] + 1] = (Y[j - p[i]] + solve(j)) % mod;
			(ans += lagrange(p[i + 1] - p[i])) %= mod;
		}
		else
			for (int j = p[i]; j < p[i + 1]; ++j)
				(ans += solve(j)) %= mod;
	}
	cout << (ans + mod) % mod << '\n';
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	init(N - 5);
	int test = 1;
	cin >> test;
	while (test--)
		_main();
	return 0;
}