//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
using namespace std;
const int N = 2e5;
int a[N + 1], b[N + 1], pos[N + 1], n, m, k;
bool del[N + 1];
multiset<int> f;
set<pair<int, int> > pivot;
struct FenwickTree
{
    int tree[N + 1];
    void reset()
    {
        fill(tree, tree + n + 1, 0);
    }
    void add(int pos, int val)
    {
        for (; pos <= n; pos |= pos + 1)
        {
            tree[pos] += val;
        }
    }
    int sum(int pos)
    {
        int ret = 0;
        for (; pos >= 0; pos = (pos & (pos + 1)) - 1)
        {
            ret += tree[pos];
        }
        return ret;
    }
    int sum(int l, int r)
    {
        return sum(r) - sum(l - 1);
    }
} tree;
void read()
{
    f.clear();
    pivot.clear();
    cin >> n >> m >> k;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i];
        pos[a[i]] = i;
        del[i] = true;
        tree.add(i, 1);
    }
    for (int i = 1; i <= m; ++ i)
    {
        cin >> b[i];
        del[b[i]] = false;
    }
    for (int i = 1; i <= k; ++ i)
    {
        int x;
        cin >> x;
        f.insert(x);
    }
}
void solve()
{
    for (int i = 2; i <= m; ++ i)
    {
        if (pos[b[i]] < pos[b[i - 1]])
        {
            cout << "NO" << '\n';
            return ;
        }
    }
    pivot.insert({1, n});
    for (int i = n; i >= 1; -- i)
    {
        auto it = pivot.upper_bound({pos[i], 1e9});
        --it;
        int l = it->first, r = it->second;
        if (!del[i])
        {
            pivot.erase(it);
            if (l < pos[i])
            {
                pivot.insert({l, pos[i] - 1});
            }
            if (r > pos[i])
            {
                pivot.insert({pos[i] + 1, r});
            }
        }
        else
        {
            int sum = tree.sum(l, r);
            auto it2 = f.upper_bound(sum);
            if (f.empty() || it2 == f.begin())
            {
                cout << "NO" << '\n';
                return ;
            }
            --it2;
            f.erase(it2);
        }
        tree.add(pos[i], -1);
    }
    cout << "YES" << '\n';
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = true;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}