#pragma GCC optimize("O3,unroll-loops")
#include <algorithm>
#include <cmath>
#include <cassert>
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <bitset>
#include <vector>
#include <queue>
#include <numeric>
#define f(x, a, b) for (int x = a; x < b; x++)
#define fm(x, a, b) for (int x = a; x > b; x--)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define sz(a) int((a).size())
using namespace std;
typedef unsigned long long ll;
typedef long long int li;
const li mod=1e9+7;

int maxq(int l, int r, vector<int> &tree) {
    int n = tree.size();
    l += n/2;
    r += n/2;
    int ans = 0;
    while(l<r) {
        if (l&1) {
            ans = max(ans,tree[l]);
            l++;
        }
        if (r&1) {
            r--;
            ans = max(ans,tree[r]);
        }
        l >>= 1;
        r >>= 1;
    }
    return ans;
}

int minq(int l, int r, vector<int> &tree) {
    int n = tree.size();
    l += n/2;
    r += n/2;
    int ans = 1e9;
    while(l<r) {
        if (l&1) {
            ans = min(ans,tree[l]);
            l++;
        }
        if (r&1) {
            r--;
            ans = min(ans,tree[r]);
        }
        l >>= 1;
        r >>= 1;
    }
    return ans;
}

int sumq(int l, int r, vector<int> &tree) {
    int n = tree.size();
    l += n/2;
    r += n/2;
    if (l>=r) return 0;
    int ans = 0;
    while(l<r) {
        if (l&1) {
            ans += tree[l];
            l++;
        }
        if (r&1) {
            r--;
            ans += tree[r];
        }
        l >>= 1;
        r >>= 1;
    }
    return ans;
}

void update(int i, int val, vector<int> &tree, bool mx) {
    int n = tree.size();
    i += n/2;
    tree[i] = val;
    while(i>1) {
        i >>= 1;
        if (mx)
        tree[i] = max(tree[2*i],tree[2*i+1]);
        else
        tree[i] = min(tree[2*i],tree[2*i+1]);
    }
}

void update2(int i, int val, vector<int> &tree) {
    int n = tree.size();
    i += n/2;
    tree[i] = val;
    while(i>1) {
        i >>= 1;
        tree[i] = tree[2*i] + tree[2*i+1];
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >>t;
    while(t--) {
        int n,m,k;
        cin >> n >> m >> k;
        vector<int> a(n);
        f(i,0,n) cin >> a[i];
        vector<int> b(m);
        f(i,0,m) cin >> b[i];
        vector<pair<int,int> > rem;
        int i1=0,i2=0;
        while(i1<n) {
            if(i2 < m && a[i1]==b[i2]) {
                i1++;
                i2++;
            }
            else {
                rem.pb(mp(a[i1],0));
                i1++;
            }
        }
        if (i2 < m) {
            cout << "NO\n";
            continue;
        }
        vector<int> l(k);
        f(i,0,k) cin >> l[i];
        sort(all(l));
        int l1 = 1;
        while(l1<=n)
            l1 <<= 1;
        vector<int> tree(2*l1,-1);
        i1=0;
        vector<int> tl(n);
        f(i,0,n) {
            if (i1 < sz(rem) && rem[i1].first == a[i]) {
                tl[i] = maxq(rem[i1].first,n,tree);
                rem[i1].second = i;
                i1++;
            }
            else {
                update(a[i],i,tree,true);
            }
        }
        tree = vector<int>(2*l1,n);
        vector<int> tr(n);
        i1 = sz(rem)-1;
        fm(i,n-1,-1) {
            if (i1 >= 0 && rem[i1].first == a[i]) {
                tr[i] = minq(rem[i1].first,n,tree);
                i1--;
            }
            else {
                update(a[i],i,tree,false);
            }
        }
        sort(all(rem));
        tree = vector<int>(2*l1,0);
        vector<int> tsum(sz(rem));
        fm(i,sz(rem)-1,-1) {
            tsum[i] = tr[rem[i].second]-tl[rem[i].second]-1 - sumq(tl[rem[i].second]+1,tr[rem[i].second]-1,tree);
            update2(rem[i].second,1,tree);
        }
        i1 = sz(rem)-1;
        fm(i,k-1,-1) {
            // cout << i1 << " " << tsum[i1] << " " << l[i] << "\n";
            if (i1>=0 && tsum[i1] >= l[i]) {
                i1--;
            }
        }
        if (i1 < 0) {
            cout << "YES\n";
        }
        else {
            cout << "NO\n";
        }


        


    }
}