#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = (a); i < (b); i++) 
#define _for(i, a, b) for(int i = (a); i <= (b); i++) 
using namespace std;

typedef long long ll;
const int N = 3e5 + 10;
const int mod = 998244353; 
int a[N], b[N], c[N << 1], n;
unordered_map<ll, int> dp;

ll id(int i, int j)
{
	return 1LL * i * 1e6 + j;
}

int main()
{
	int T; scanf("%d", &T);
	while(T--)
	{
		dp.clear();
		scanf("%d", &n);
		_for(i, 1, n)
		{
			int x; scanf("%d", &x);
			a[x] = i;
		}
		_for(i, 1, n)
		{
			int x; scanf("%d", &x);
			b[x] = i;
		}
		_for(i, 1, 2 * n) scanf("%d", &c[i]);

		dp[id(0, 0)] = 1;
		_for(k, 1, 2 * n)
		{
			int i = a[c[k]];
			int j = k - i;
			if(j >= 0) (dp[id(i, j)] += dp[id(i - 1, j)]) %= mod;

			j = b[c[k]];
			i = k - j;
			if(i >= 0) (dp[id(i, j)] += dp[id(i, j - 1)]) %= mod;
		}
		printf("%d\n", dp[id(n, n)]);
	}
	
	return 0;
}