#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int N = 2e5 + 10;

int tr[N];

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

void add(int pos, int d) {
    if(pos <= 0) return ;
    for(int i = pos; i < N; i += lowbit(i)) {
        tr[i] += d;
    }
}

int query(int pos) {
    int res = 0;
    if(pos <= 0) return 0;
    for(int i = pos; i; i -= lowbit(i)) {
        res += tr[i];
    }
    return res;
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    std::vector<int> pos(n + 1), has(n + 1);
    for(int i = 1, x; i <= n; i ++ ) {
        cin >> x;
        pos[x] = i;
    }
    vector<int> a(m + 1);
    for(int i = 1, x; i <= m; i ++ ) {
        cin >> x;
        has[x] = 1;
        a[i] = x;
    }
    for(int i = 1; i < m; i ++ ) {
        if(pos[a[i + 1]] < pos[a[i]]) {
            cout << "NO\n";
            return ;
        }
    }
    multiset<int> st;
    st.insert(0);
    st.insert(n + 1);
    for(int i = 1, x; i <= k; i ++ ) {
        cin >> x;
        st.insert(x);
    }
    set<int> p;
    p.insert(0);
    p.insert(n + 1);
    bool fg = 0;
    vector<int> need_del(n + 1);
    for(int i = n; i >= 1; i -- ) {
        if(!has[i]) {
            auto it = p.upper_bound(pos[i]);
            assert(it != p.end());
            int l = *prev(it), r = *it;
            int w = r - l - 1 - (query(r) - query(l));
            // cout << i << ' ' << l << ' ' << r << ' ' << w << '\n';
            assert(w <= n);
            auto it2 = prev(st.upper_bound(w));
            if((*it2) == 0) {
                fg = 1;
                break;
            } else {
                st.erase(it2);
                add(pos[i], 1);
                need_del[pos[i]] = 1;
            }
        } else {
            p.insert(pos[i]);
        }
    }
    if(fg) {
        cout << "NO\n";
    } else {
        cout << "YES\n";
    }
    for(int i = 1; i <= n; i ++ ) {
        if(need_del[i]) {
            add(i, -1);
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    int t = 1;
    cin >> t;
    while(t -- ) {
        solve();
    }

    return 0;
}