#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>


using namespace std;
using ll = long long;

inline char getC() { //Don't use it in interactive problems!!!
    static char *p1, *p2, buf[1<<20];
    return p1==p2?(p2=(p1=buf)+fread(buf, 1, 1<<20, stdin), p1==p2?'\n':*p1++):*p1++;
}
inline char getc() {
    char c; while (isspace(c=getC()));
    return c;
}
inline void read(char *s) {
    char c; while (isspace(c=getC()));
    while (!isspace(c)) (*s++)=c, c=getC(); (*s++)='\0';
}
inline int read() {
    int f=1, r=0; char c=getC();
    while (!isdigit(c)) f^=c=='-', c=getC();
    while (isdigit(c)) r=r*10+c-48, c=getC();
    return f?r:-r;
}

const int MAXN=1e6+7;
int n,m,k;
int a[MAXN],b[MAXN],c[MAXN],d[MAXN],tot=0,loc[MAXN];
int sum[MAXN],l[MAXN],r[MAXN],val[MAXN];
bool vis[MAXN],pd[MAXN];
void add(int x,int y)
{
    for(;x<=n;x+=x&(-x)) sum[x]+=y;
    return;
}
int ask_sum(int x)
{
    int res=0;
    for(;x;x-=x&(-x)) res+=sum[x];
    return res;
}
void push_up(int x)
{
   val[x]=max(val[x*2],val[2*x+1]);
   return;
}
void build(int x,int li,int ri)
{
    int mid=(li+ri)>>1;
    l[x]=li;r[x]=ri;val[x]=0;
    if(l[x]==r[x])
    {
        val[x]=a[li];
        return;
    }
    build(2*x,li,mid);
    build(2*x+1,mid+1,ri);
    push_up(x);
    return;
}
void modify(int x,int loc,int y)
{
    int mid=(l[x]+r[x])>>1;
    if(l[x]==r[x])
    {
        val[x]=y;
        return;
    }
    if(loc<=mid) modify(2*x,loc,y);
    else modify(2*x+1,loc,y);
    push_up(x);
    return;
}
int ask(int x,int li,int ri)
{
    int mid=(l[x]+r[x])>>1;
    if(l[x]==li && r[x]==ri) return val[x];
    push_up(x);
    if(ri<=mid) return ask(2*x,li,ri);
    else if(li>mid) return ask(2*x+1,li,ri);
    else return max(ask(2*x,li,mid),ask(2*x+1,mid+1,ri));
}
void solve() {
    // cin >> n >> m >> k;
    n = read();
    m = read();
    k = read();

//    vector<int> a(n + 1), b(m + 1), c(k + 1);
    for (int i = 1; i <= n; i++) {
        // cin >> a[i];
        a[i] = read();
        loc[a[i]]=i;
        vis[i]=0;
    }

    build(1,1,n);
    for (int i = 1; i <= m; i++) {
        // cin >> b[i];
        b[i] = read();
        vis[b[i]]=1;
    }
    multiset<int> s;
    for (int i = 1; i <= k; i++) {
        // cin >> c[i];
        c[i] = read();
        s.insert(-c[i]);
    }

   /* int pos = 1;
    for (int i = 1; pos <= m; pos++) {
        while (i <= n and a[i] != b[pos]) i++;
        if (i == n + 1) {
            cout << "No\n";
            return;
        }
    }*/

    sort(c+1,c+1+k);

    tot=0;
    for(int i=1;i<=n;i++) if(!vis[i]) d[++tot]=loc[i];
    bool flag=1;
    for(int i=tot;i>=1;i--) {
//        cerr<<d[i]<<" "<<a[d[i]]<<"  asd"<<endl;
        int l = d[i]+1, r = n, mid, len_r = 0, len_l = 0, lock = -1;
        while (l <= r) {
            mid = (l + r) >> 1;

            if (ask(1, d[i]+1, mid) > a[d[i]]) r = mid - 1, lock = mid;
            else l = mid + 1;
        }
        if (lock == -1) lock = n+1;
        len_r = lock - d[i]-1;

        l = 1;
        r = d[i]-1;
        lock = -1;
        while (l <= r) {
            mid = (l + r) >> 1;
            if (ask(1, mid, d[i]-1) > a[d[i]]) l = mid + 1, lock = mid;
            else r = mid - 1;
        }
        if (lock == -1) lock = 0;
        len_l = d[i] - lock-1;

        int len = len_l + len_r + 1;
        int num = ask_sum(d[i] + len_r) - ask_sum(d[i] - len_l - 1);
        len -= num;
//        cerr<<len<<" "<<len_l<<" "<<len_r<<"   sad"<<endl;
        auto tmp = s.lower_bound(-len);
        if (tmp == s.end()) {
            flag = 0;
            break;
        } else {
//            s.extract(*tmp);
            s.erase(tmp);
            add(d[i], 1);
            modify(1, d[i], 0);
            pd[d[i]]=1;
        }
    }
    tot=0;
    for(int i=1;i<=n;i++)
    {
        if(pd[i]) continue;
        d[++tot]=a[i];
    }
    if(tot!=m) flag=0;
    for(int i=1;i<=tot;i++)
    {
        if(d[i]!=b[i]) {flag=0;break;}
    }
    if(flag) cout<<"YES\n";
    else cout<<"NO\n";
    for(int i=0;i<=n;i++) sum[i]=0,vis[i]=0,pd[i]=0;

}

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    int _ = 1;
    // cin >> _;
    _ = read();
    while (_--) solve();

    return 0;
}