#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int sz = 1e5 + 5, mod = 1e9 + 7;
int bit[sz],n;
//bit is 1 based indexing
//at x index update delta
void update(int x, int delta) {
      for(; x <= n; x += x&-x)
        bit[x] += delta;
}
//query sum from 1 to x index
int query(int x) {
     int sum = 0;
     for(; x > 0; x -= x&-x)
        sum += bit[x];
     return sum;
}
int query(int l, int r) {
    return query(r) - query(l - 1);
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1; cin >> t;
    while(t--) {
        int m, k; cin >> n >> m >> k;
        std::vector<int> arr(n + 1), id(n + 1), brr(m + 1), ase(n + 1);
        for(int i = 1; i <= n; i++) {
            cin >> arr[i];
            id[arr[i]] = i;
            bit[i] = 0;
        }
        int pos = 1;
        for(int i = 1; i <= m; i++) {
            cin >> brr[i];
            if(i > 1 && id[brr[i - 1]] > id[brr[i]]) pos = 0;
            ase[brr[i]] = 1;
        }
        set<int>st;
        
        multiset<int>st1;
        
        while(k--) {
            int a; cin >> a;
            st1.insert(a);
        }
        
        if(!pos) {
            cout << "NO\n";
            continue;
        }
        
        for(int i = 0; i <= n + 1; i += n + 1)
            st.insert(i);

        for(int i = n; i >= 1 && pos; i--) {
            if(ase[i]) {
                st.insert(id[i]);
            } else {
                auto it = st.lower_bound(id[i]);
                int l = *prev(it) + 1;
                int r = (*it) - 1;
                int len = r - l + 1 - query(l, r);
                it = st1.upper_bound(len);
                if(it == st1.begin()) pos = 0;
                else {
                    it--;
                    st1.erase(it);
                }
                update(id[i], 1);
            }
        }
        
        cout << (pos?"YES\n":"NO\n");
    }
    return 0; 
}