#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
typedef pair<int, int> PII;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
int T;
int n, m, k;
int c[N], a[N], b[N], pos[N], x;
multiset<int> st;
int lowbit(int x)
{
    return x & -x;
}

void add(int x, int val)
{
    while (x <= n)
    {
        c[x] += val;
        x += lowbit(x);
    }
}

int getsum(int x)
{
    int sum = 0;
    while (x > 0)
    {
        sum += c[x];
        x -= lowbit(x);
    }
    return sum;
}
bool islv[N];
void solve()
{
    // code
    cin >> n >> m >> k;
    st.clear();
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        pos[a[i]] = i;
        c[i] = 0;
        islv[i] = 0;
    }
    for (int i = 1; i <= n; i++)
    {
        add(i, 1);
    }
    for (int i = 1; i <= m; i++)
    {
        cin >> b[i];
        islv[b[i]] = 1;
    }
    for (int i = 1; i <= k; i++)
    {
        cin >> x;
        st.insert(x);
    }
    int j = 1;
    for (int i = 1; i <= n; i++)
    {
        if (a[i] == b[j] && j <= m)
        {
            j++;
        }
    }
    if (j != m + 1)
    {
        cout << "NO" << '\n';
        return;
    }
    set<int> st2;
    st2.insert(0);
    st2.insert(n + 1);
    for (int i = n; i >= 1; i--)
    {
        if (islv[i])
        {
            st2.insert(pos[i]);
            continue;
        }
        auto r = st2.lower_bound(pos[i]);
        auto l = prev(r);
        int len = getsum((*r) - 1) - getsum(*l);
        add(pos[i], -1);
        auto it = st.upper_bound(len);
        if (it == st.begin())
        {
            cout << "NO" << endl;
            return;
        }
        st.erase(--it);
    }
    cout << "YES" << '\n';
}
int main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);

    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}