#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define N 300005
#define mod 998244353

int n, a[N], b[N], c[N << 1];
void solve()
{
    cin >> n;
    for (int i = 1, x; i <= n; i++)
    {
        cin >> x;
        a[x] = i;
    }
    for (int i = 1, x; i <= n; i++)
    {
        cin >> x;
        b[x] = i;
    }
    for (int i = 1; i <= n * 2; i++)
        cin >> c[i];
    map<pair<int, int>, int> dp;
    dp[{0, 0}] = 1;
    for (int i = 1; i <= n * 2; i++)
    {
        int lena = a[c[i]];
        int lenb = i - lena;
        if (dp.count({lena - 1, lenb}))
            dp[{lena, lenb}] = (dp[{lena, lenb}] + dp[{lena - 1, lenb}]) % mod;
        lenb = b[c[i]];
        lena = i - lenb;
        if (dp.count({lena, lenb - 1}))
            dp[{lena, lenb}] = (dp[{lena, lenb}] + dp[{lena, lenb - 1}]) % mod;
    }
    cout << dp[{n, n}] << '\n';
}

signed main()

{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}