#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#define x first
#define y second
using namespace std;
typedef pair<int, int> PII;
typedef long long LL;
const int N = 2e5 + 10;
typedef struct Node
{
    int l, r, max, cnt;
} Node;
Node tr[N * 4];
int T;
int n, m, k;
int a[N], b[N], pos[N];
bool st[N];
vector<int> ans, ini;
vector<PII> num;
bool cmp(PII a, PII b)
{
    return a.x > b.x;
}
bool cmp2(int a, int b)
{
    return a > b;
}
void pushup(int u)
{
    tr[u].max = max(tr[u << 1].max, tr[u << 1 | 1].max);
    tr[u].cnt = tr[u << 1].cnt + tr[u << 1 | 1].cnt;
}
void build(int u, int l, int r)
{
    tr[u] = {l, r, 0, 0};
    if (l == r)
        return;
    int mid = l + r >> 1;
    build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
}
void modify(int u, int x, int d)
{
    int l = tr[u].l, r = tr[u].r, mid = l + r >> 1;
    if (l == r)
    {
        tr[u].max += d;
        if (d > 0)
            tr[u].cnt++;
        else
            tr[u].cnt--;
        return;
    }
    if (x <= mid)
        modify(u << 1, x, d);
    else
        modify(u << 1 | 1, x, d);
    pushup(u);
}
int query_max(int u, int x, int y)
{
    int l = tr[u].l, r = tr[u].r, mid = l + r >> 1;
    if (x <= l && r <= y)
        return tr[u].max;
    int res = 0;
    if (x <= mid)
        res = max(res, query_max(u << 1, x, y));
    if (y > mid)
        res = max(res, query_max(u << 1 | 1, x, y));
    return res;
}
int query_cnt(int u, int x, int y)
{
    int l = tr[u].l, r = tr[u].r, mid = l + r >> 1;
    if (x <= l && r <= y)
        return tr[u].cnt;
    int res = 0;
    if (x <= mid)
        res += query_cnt(u << 1, x, y);
    if (y > mid)
        res += query_cnt(u << 1 | 1, x, y);
    return res;
}
int main()
{
    // ios::sync_with_stdio(0);
    // cin.tie(0);
    // cout.tie(0);
    // cin >> T;
    scanf("%d", &T);
    while (T--)
    {
        // cin >> n >> m >> k;
        scanf("%d%d%d", &n, &m, &k);
        for (int i = 1; i <= n; i++)
            // cin >> a[i];
            scanf("%d", &a[i]);
        for (int i = 1; i <= m; i++)
            // cin >> b[i];
            scanf("%d", &b[i]);
        ini.clear();
        ans.clear();
        for (int i = 1; i <= k; i++)
        {
            int x;
            // cin >> x;
            scanf("%d", &x);
            ini.push_back(x);
        }
        if (n - m > k)
        {
            // cout << "NO" << endl;
            puts("NO");
            continue;
        }

        for (int i = 1; i <= n; i++)
            st[i] = 0, pos[i] = 0;
        for (int i = 1; i <= n; i++)
            pos[a[i]] = i;
        bool flag = 1;
        for (int i = 1; i < m; i++)
            if (pos[b[i]] > pos[b[i + 1]])
            {
                flag = 0;
                break;
            }
            else
                st[b[i]] = 1;
        st[b[m]] = 1;
        if (!flag)
        {
            // cout << "NO" << endl;
            puts("NO");
            continue;
        }
        // for (int i = 1; i <= m; i++)
        //     st[b[i]] = 1;

        num.clear();
        for (int i = 1; i <= n; i++)
            if (!st[a[i]])
                num.push_back({a[i], i});
        sort(num.begin(), num.end(), cmp);

        build(1, 1, n); // 同时维护cnt和max
        for (int i = 1; i <= n; i++)
            modify(1, i, a[i]);

        for (int i = 0; i < num.size(); i++)
        {
            int v = num[i].x, pos = num[i].y;
            int L = 1, R = n;
            int l = 1, r = pos, mid;
            while (l < r)
            {
                mid = l + r >> 1;
                if (query_max(1, mid, pos) <= v)
                    r = mid;
                else
                    l = mid + 1;
            }
            L = max(L, l);
            l = pos, r = n, mid;
            while (l < r)
            {
                mid = l + r + 1 >> 1;
                if (query_max(1, pos, mid) <= v)
                    l = mid;
                else
                    r = mid - 1;
            }
            R = min(R, r);
            // cout << '[' << L << ',' << R << "]: " << pos << ' ' << v << ' ' << query_cnt(1, L, R) << endl;
            ans.push_back(query_cnt(1, L, R));
            modify(1, pos, -v);
        }

        sort(ans.begin(), ans.end(), cmp2);
        sort(ini.begin(), ini.end(), cmp2);
        flag = 1;
        int idx = 0;
        for (int i = 0; i < ans.size(); i++)
        {
            while (idx < ini.size() && ans[i] < ini[idx])
                idx++;
            if (idx >= ini.size())
            {
                flag = 0;
                break;
            }
            idx++;
        }
        // for (int i = 0; i < ans.size(); i++)
        //     cout << ans[i] << ' ';
        // cout << endl;
        if (flag)
            // cout << "YES" << endl;
            puts("YES");
        else
            // cout << "NO" << endl;
            puts("NO");
    }
    return 0;
}
/*
3
6 2 4
1 5 4 6 3 2
5 2
1 4 3 6

7 3 5
7 6 5 3 4 2 1
5 4 3
7 6 2 1 3

6 2 4
1 5 4 6 3 2
5 2
1 4 3 6


2
1 1 1
1
1
1
2 1 1
2 1
1
1
*/