#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

int MAXN = 2e5, n;
vector<int> t(4 * MAXN + 5);
vector<int> a(MAXN);

void build(vector<int> &a, int v, int tl, int tr)
{
    if(tl == tr)
    {
        t[v] = tl;
        return;
    }

    int tm = (tl + tr) / 2;
    build(a, 2 * v, tl, tm);
    build(a, 2 * v + 1, tm + 1, tr);

    if(a[t[2 * v]] > a[t[2 * v+  1]]) t[v] = t[2 * v];
    else t[v] = t[2 * v + 1];
}

int query(int v, int tl, int tr, int l, int r)
{
    if (l > r)
        return -1;
    if (l == tl && r == tr) {
        return t[v];
    }
    int tm = (tl + tr) / 2;

    int x1 = query(v*2, tl, tm, l, min(r, tm)), x2 = query(v*2+1, tm+1, tr, max(l, tm+1), r);

    if(x1 == -1 || x2 == -1) return x1 + x2 + 1;

    if(a[x1] > a[x2]) return x1;
    else return x2;
}

void build_graph(vector<vector<int>> & adj, int p, int l, int r)
{
    //cout << "Build " << p << " " << l << " " << r << " ";

    if(l >= r) return;
    int x = query(1, 0, n - 1, l, p - 1);
    int y = query(1, 0, n - 1, p + 1, r);

    //cout << " = " << x << " " << y << "\n";
    //getchar();

    if(x != -1)
    {
        adj[p].pb(x);
        build_graph(adj, x, l, p - 1);
    }
    if(y != -1)
    {
        adj[p].pb(y);
        build_graph(adj, y, p + 1, r);
    }
}

void dfs(int p, vector<vector<int>> &adj, vector<int> & v)
{
    for(int c: adj[p])
    {
        dfs(c, adj, v);
        v[p] += v[c];
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	int T = 1;
	cin >> T;
    while(T-->0)
    {
        int m, k;
        cin >> n >> m >> k;

        vector<int> b(m);
        vector<int> d(k);
        vector<int> pos(n + 1);
        vector<vector<int>> adj(n + 1);

        for(int i=0; i<n; i++)
        {
            cin >> a[i];
            pos[a[i]] = i;
        }
        for(int i=0; i<m; i++) cin >> b[i];
        for(int i=0; i<k; i++) cin >> d[i];

        build(a, 1, 0, n - 1);

        /*for(int i = 0; i < 4 * n + 1; i++) cout << t[i] << " ";
        cout << "\n";*/

        build_graph(adj, pos[n], 0, n - 1);

        /*for(vector<int> x: adj)
        {
            for(int y: x) cout << y << " ";
            cout << "\n";
        }*/

        vector<int> v(n, 1);
        dfs(pos[n], adj, v);

        vector<int> c;
        int index = 0;
        for(int i=0; i<n; i++)
        {
            if(index != m && a[i] == b[index]) index++;
            else c.pb(v[pos[a[i]]]);
        }

        if(index != m)
        {
            cout << "NO\n";
            continue;
        }

        /*for(int x: c) cout << x << " ";
        cout << " ->\n";*/

        sort(c.begin(), c.end());
        sort(d.begin(), d.end());

        if(c.size() < n - m)
        {
            cout << "NO\n";
            continue;
        }

        bool ans = true;
        for(int i=0; i<n - m; i++)
        {
            if(c[i] < d[i]) ans = false;
        }

        if(ans) cout << "YES\n";
        else cout << "NO\n";
    }
}
/*
1
5 2 3
5 1 3 2 4
5 2
1 2 4
*/