#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int sz = 1e5 + 5, mod = 1e9 + 7;
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1; cin >> t;
    while(t--) {
        int n, 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;
        }
        int pos = 1;
        for(int i = 1; i <= m; i++) {
            cin >> brr[i];
            if(i > 1 && id[brr[i - 1]] > i) pos = 0;
            ase[brr[i]] = 1;
        }
        if(!pos) {
            cout << "NO\n";
            continue;
        }
        set<int>st;
        map<int,int>mp;
        multiset<int>st1;
        while(k--) {
            int a; cin >> a;
            st1.insert(a);
        }
        for(int i = 0; i <= n + 1; i++)
            st.insert(i);
        for(int i = 1; i <= n && pos; i++) {
            if(ase[i]) {
                st.erase(id[i]);
            } else {
                int a = id[i];
                st.erase(a);
                auto it = st.lower_bound(a);
                int l = *prev(it);
                int r = *it;
                int len = r - l - 1;
                it = st1.upper_bound(len);
                if(it == st1.begin()) pos = 0;
                else {
                    it--;
                    st1.erase(it);
                }
            }
        }
        cout << (pos?"YES\n":"NO\n");
    }
    return 0; 
}