#include <bits/stdc++.h>
#define vec vector
#define pb push_back
#define pii pair<int,int>
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define ll long long


using namespace std;


const int LIM = 1<<18;
struct St {
    vec<int> A;
    int DEFAULT=0;
    St() {
        A.resize(LIM<<1, DEFAULT);
        fill(all(A), DEFAULT);
    }
    int merge(int a, int b) {
        return a+b;
    }
    void upd(int idx, int val) {
        idx+=LIM;
        A[idx]=val;
        idx>>=1;
        while (idx) {
            A[idx]=merge(A[idx*2], A[idx*2+1]);
            idx>>=1;
        }
    }
    int query(int nd, int l, int r, int ql, int qr) {
        if (ql<=l && r<=qr) return A[nd];
        else if (ql>r || qr<l) return DEFAULT;
        else {
            int md=(l+r)/2;
            return merge(query(nd*2, l, md, ql, qr), query(nd*2+1, md+1, r, ql, qr));
        }
    }
};

struct StMx {
    vec<pii> A;
    pii DEFAULT={-1e9,-1e9};
    StMx() {
        A.resize(LIM<<1, DEFAULT);
        fill(all(A), DEFAULT);
    }
    pii merge(pii a, pii b) {
        return max(a,b);
    }
    void upd(int idx, int val) {
        A[idx+LIM]={val,idx};
        idx+=LIM;
        idx>>=1;
        while (idx) {
            A[idx]=merge(A[idx*2], A[idx*2+1]);
            idx>>=1;
        }
    }
    pii query(int nd, int l, int r, int ql, int qr) {
        if (ql<=l && r<=qr) return A[nd];
        else if (ql>r || qr<l) return DEFAULT;
        else {
            int md=(l+r)/2;
            return merge(query(nd*2, l, md, ql, qr), query(nd*2+1, md+1, r, ql, qr));
        }
    }
};


void solve() {
    int n,m,k;cin>>n>>m>>k;
    vec<int> a(n),b(m),L(k);

    for (auto&x:a)cin>>x;
    for (auto&x:b)cin>>x;
    for (auto&x:L)cin>>x;

    // cout<<"DBG "<<n<<m<<k<<endl;

    vec<pii> rmlst;


    { // check possible
        int idx=0;
        for (auto x:b) {
            while (idx<n && x!=a[idx]) {
                rmlst.pb({a[idx], idx});
                idx++;
            }
            if (idx>=n || a[idx]!=x) {
                cout<<"NO\n";
                return;
            }
            idx++;
        }
        while (idx<n) {
            rmlst.pb({a[idx], idx});
            idx++;
        }
        if (rmlst.size()>k) {
            cout<<"NO\n";
            return;
        }
    }
    
    sort(all(rmlst));
    reverse(all(rmlst));
    multiset<int> ls(all(L));

    St erased;
    StMx mxs;
    for (int i=0;i<n;i++) mxs.upd(i, a[i]);

    // cout<<"hello"<<endl;

    for (auto torm:rmlst) {
        int lmst=torm.sc,rmst=torm.sc;
        // cout<<"torm "<<torm.fs<<" "<<torm.sc<<endl;
        {
            int l=0,r=torm.sc;
            while (l<=r) {
                int md=(l+r)/2;
                // cout<<"testing"<<md<<'\n';
                auto res=mxs.query(1, 0, LIM-1, md, torm.sc);
                // cout<<res.fs<<' '<<res.sc<<" whem"<<md<<endl;
                if (res==torm) {
                    lmst=min(lmst, md);
                    r=md-1;
                } else {
                    l=md+1;
                }
            }
        }
        // cout<<"mid"<<lmst<<endl;
        {
            int l=torm.sc,r=n-1;
            while (l<=r) {
                int md=(l+r)/2;
                // cout<<"testing2 "<<md<<'\n';
                auto res=mxs.query(1, 0, LIM-1, torm.sc, md);
                // cout<<res.fs<<' '<<res.sc<<" whem2 "<<md<<endl;
                if (res==torm) {
                    rmst=max(rmst, md);
                    l=md+1;
                } else {
                    r=md-1;
                }
            }
        }
        // cout<<"msts "<<lmst<<' '<<rmst<<endl;
        int ecnt=erased.query(1,0,LIM-1, lmst,rmst);
        int mxusable=rmst-lmst+1-ecnt;

        auto ptr = ls.upper_bound(mxusable);
        if (ptr==ls.begin()) {
            cout<<"NO\n";
            return;
        }
        ls.erase(--ptr);
        mxs.upd(torm.sc, 0);
        erased.upd(torm.sc, 1);
    }

    cout<<"YES\n";
}

signed main() {
    ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int tc=1;
    cin>>tc;
    while (tc--) {
        // cout<<"TC" <<tc<<'\n';
        solve();
    }
    return 0;
}