#include "bits/stdc++.h"
using namespace std;
using ll = int;

const ll N = 1e6 + 1;
const ll M = 1e9 + 7;

struct STN {ll mx, cnt;};
struct SegmentTree {
    const STN DEF = {(ll)-1e9, 0};
    vector<STN> s; ll uu, vv;
    SegmentTree(ll n): s(4 * n + 10, DEF), uu(0), vv(n) {}
    
    STN merge(STN a, STN b) {
        return {max(a.mx, b.mx), a.cnt + b.cnt};
    }

    void update(ll pos, ll val, ll cnt) {update(pos, val, cnt, 1, uu, vv);}
    void update(ll pos, ll val, ll cnt, ll id, ll l, ll r) {
        if (l > pos || r < pos) return;
        if (l == r) {
            s[id] = {val, cnt};
            return;
        }
        ll mid = (l + r) >> 1;
        update(pos, val, cnt, id << 1, l, mid);
        update(pos, val, cnt, id << 1 | 1, mid + 1, r);
        s[id] = merge(s[id << 1], s[id << 1 | 1]);
    }
    STN get(ll u, ll v) {return get(u, v, 1, uu, vv);}
    STN get(ll u, ll v, ll id, ll l, ll r) {
        if (l > v || r < u) return DEF;
        if (u <= l && r <= v) return s[id];
        ll mid = (l + r) >> 1;
        return merge(get(u, v, id << 1, l, mid), get(u, v, id << 1 | 1, mid + 1, r));
    }
};

ll n, m, k;
ll a[N], b[N], l[N], pp[N];

bool inorder() {
    ll j = 1;
    for (int i = 1; i <= n; i ++)
        if (a[i] == b[j]) j ++;
    return (j >= m + 1);
}

void doTest(ll testID) {
    cin >> n >> m >> k; SegmentTree st(n);
    for (int i = 1; i <= n; i ++) cin >> a[i], st.update(i, a[i], 1);
    for (int i = 1; i <= m; i ++) cin >> b[i];
    for (int i = 1; i <= k; i ++) cin >> l[i];

    if (k + m < n) {cout << "NO\n"; return;}
    if (!inorder()) {cout << "NO\n"; return;}

    for (int i = 1; i <= n; i ++) pp[a[i]] = 1;
    for (int i = 1; i <= m; i ++) pp[b[i]] = 0;
    
    vector<ll> choose;
    for (int i = 1; i <= n; i ++)
        if (pp[a[i]] == 1) choose.push_back(i); 
    
    sort(choose.begin(), choose.end(), [&](ll i, ll j) -> bool {return a[i] > a[j];});

    // cout << "<CHOOSE>" << endl;
    // for (int i = 0; i < choose.size(); i ++) cout << choose[i] << ' '; cout << endl;

    vector<ll> len;
    for (auto x: choose) {
        ll lcnt = 0, rcnt = 0;
        
        ll l = 1, r = x, mid, res = -1;
        while (r >= l) {
            mid = (r + l) >> 1;
            if (st.get(mid, x).mx <= a[x]) r = (res = mid) - 1;
            else l = mid + 1;
        }
        if (res != -1) lcnt = st.get(res, x).cnt; 
        
        l = x, r = n, mid, res = -1;
        while (r >= l) {
            mid = (r + l) >> 1;
            if (st.get(x, mid).mx <= a[x]) l = (res = mid) + 1;
            else r = mid - 1;
        }
        if (res != -1) rcnt = st.get(x, res).cnt; 
    
        len.push_back(lcnt + rcnt - 1);
        st.update(x, 0, 0);
    }
    
    // cout << "<LEN>" << endl;
    // for (int i = 0; i < len.size(); i ++) cout << len[i] << ' '; cout << endl;

    sort(len.begin(), len.end());
    sort(l + 1, l + k + 1);
    for (int i = 0; i < len.size(); i ++)
        if (len[i] < l[i + 1]) {cout << "NO\n"; return;}
    cout << "YES\n";
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int test = 1; 
    cin >> test;
    for (int _ = 1; _ <= test; _ ++) doTest(test);
}