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

int n, a[N], b[N], c[N << 1], s[N];
int lowbit(int x) { return x & -x; }
void add(int x, int y)
{
    while (x <= n)
    {
        s[x] += y;
        x += lowbit(x);
    }
}
int query(int x)
{
    int res = 0;
    while (x)
    {
        res += s[x];
        x -= lowbit(x);
    }
    return res;
}
void solve()
{
    cin >> n;
    fill(s + 1, s + n + 1, 0);
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> b[i];
    for (int i = 1; i <= n * 2; i++)
        cin >> c[i];
    int ans = 1, pre = 1;
    set<int> s;
    for (int i = 1; i <= n * 2; i++)
    {
        if (!s.count(c[i]))
        {
            if (query(c[i] - 1) < c[i] - 1)
            {
                cout << 0 << '\n';
                return;
            }
            if (query(c[i] - 1) == (c[i] - 1) * 2)
                ans = ans * 2 % mod;
            s.insert(c[i]);
        }
        else
        {
            if (query(c[i] - 1) != 2 * c[i] - 2)
            {
                cout << 0 << '\n';
                return;
            }
        }
        add(c[i], 1);
    }
    cout << ans << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}