#include<bits/stdc++.h> 
#define int long long 
#define endl '\n'
using namespace std;
int T,n,m,k;
const int N = 2e5 + 10;
int tr[N],pos[N],a[N],b[N],st[N];

int lowbit(int x)
{
    return x & -x;
}

void modify(int x,int d)
{
    for(int i = x;i <= n;i += lowbit(i))
    {
        tr[i] += d;
    }
}

int qry(int x)
{
    int res = 0;
    for(int i = x;i <= n;i += lowbit(i))
    {
        res += tr[i];
    }
    return res;
}

int query(int l,int r)
{
    if(l > r) return 0;
    return qry(r) - qry(l - 1);
}

void init()
{
    for(int i = 1;i <= n;i++) tr[i] = pos[i] = st[i] = 0;
}

void solve()
{
    cin >> n >> m >> k;
    init();
    for(int i = 1;i <= n;i++) cin >> a[i],pos[a[i]] = i;
    for(int i = 1;i <= m;i++) cin >> b[i],st[b[i]] = 1;
    multiset<int> nums;
    for(int i = 1;i <= k;i++) 
    {
        int x;
        cin >> x;
        nums.insert(x);
    }
    set<int> cur = {0,n + 1};
    for(int i = n;i;i--)
    {
        if(!st[i])
        {
            if(!nums.size())
            {
                cout << "NO" << endl;
                return ;
            }
            auto rptr = cur.upper_bound(pos[i]);
            auto lptr = cur.lower_bound(pos[i]);
            if(lptr == cur.begin())
            {
                cout << "NO" << endl;
                return ;
            }
            int l = *prev(lptr),r = *rptr;
            int len = r - l - 1 - query(l + 1,r - 1);
            auto it = nums.upper_bound(len);
            if(it == nums.begin())
            {
                cout << "NO" << endl;
                return ;
            }
            nums.erase(prev(it));
            modify(pos[i],1);
        }
        else cur.insert(pos[i]);
    }
    cout << "YES" << endl;
}

signed main( )
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> T;
    while(T--)
    {
        solve();
    }
}