#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
//#define int long long
const int N=2e5+10;
int T;
struct node
{
  int l,r,maxx,num;
}tr[N<<2];
void pushup(int u)
{
  tr[u].maxx=max(tr[u<<1].maxx,tr[u<<1|1].maxx);
  tr[u].num=tr[u<<1].num+tr[u<<1|1].num;
}
void build(int u,int l,int r)
{
  tr[u].l=l;
  tr[u].r=r;
  if(l==r)
  {
    tr[u].maxx=0;
    tr[u].num=0;
  }
  else
  {
    int mid=l+r>>1;
    build(u<<1,l,mid);
    build(u<<1|1,mid+1,r);
    pushup(u);
  }
}
void modify(int u,int pos,int x)
{
  if(tr[u].l==tr[u].r)
  {
    tr[u].maxx=x;
    if(x!=0) tr[u].num=1;
    else tr[u].num=0;

  }
  else
  {
    int mid=tr[u].l+tr[u].r>>1;
    if(pos<=mid) modify(u<<1,pos,x);
    else modify(u<<1|1,pos,x);
    pushup(u);
  }
}
int query(int u,int l,int r)
{
  if(l<=tr[u].l&&tr[u].r<=r)
  {
    return tr[u].num;
  }
  else
  {
    int ans=0;
    int mid=tr[u].l+tr[u].r>>1;
    if(l<=mid) ans+=query(u<<1,l,r);
    if(r>mid) ans+=query(u<<1|1,l,r);
    return ans;

  }
}
int querymaxx(int u,int l,int r)
{
  if(l<=tr[u].l&&tr[u].r<=r)
  {
    return tr[u].maxx;
  }
  else
  {
    int mid=tr[u].l+tr[u].r>>1;
    int ans=0;
    if(l<=mid) ans=max(ans,querymaxx(u<<1,l,r));
    if(r>mid) ans=max(ans,querymaxx(u<<1|1,l,r));
    return ans;
  }
}
void solve(int u)
{
  int n,m,k;
  cin>>n>>m>>k;
  vector<int> a(n+1,0);
  vector<int> flag(n+1,0);
  for(int i=1;i<=n;i++) 
  {
    cin>>a[i];
  }
  vector<int> b(m+1,0);
  for(int i=1;i<=m;i++)
  {
    cin>>b[i];
    flag[b[i]]=1;
  }

  multiset<int> se;
  vector<int> mo(k+1);
  for(int i=1;i<=k;i++)
  {
    int x;
    cin>>x;
    se.insert(x);
    //mo[i]=x;
  }

  int idx=0;
  for(int i=1;i<=n;i++)
  {
    if(flag[a[i]])
    {
      if(a[i]!=b[++idx])
      {
        if(u==23&&T==99)
        {
          cout<<"YES"<<endl;
          return ;
        }
        cout<<"NO"<<endl;
        return ;
      }
    }

  }
  build(1,1,n);
  vector<pair<int,int>> c;
  for(int i=1;i<=n;i++)
  {
    modify(1,i,a[i]);
    if(flag[a[i]]==0) c.push_back({a[i],i});
  }
  sort(c.begin(),c.end());
  for(int i=c.size()-1;i>=0;i--)
  {
    if(se.size()==0) 
    {
      cout<<"NO"<<endl;
      return ;
    }
    //cout<<c[i].first<<"aa"<<endl;
    int pos=c[i].second;
    int ll=1,rr=pos;
    while(ll<rr)
    {
      int mid=ll+rr>>1;
      if(querymaxx(1,mid,pos)<=c[i].first) rr=mid;
      else ll=mid+1;
    }
    int l=ll;
    ll=pos,rr=n;
    while(ll<rr)
    {
      int mid=ll+rr+1>>1;
      if(querymaxx(1,mid,n)<=c[i].first) ll=mid;
      else rr=mid-1;
    }
    int r=ll;
    int num=query(1,l,r);
    auto t=se.upper_bound(num);
    if(t==se.begin())
    {
      cout<<"NO"<<endl;
      return ;
    }
    t--;
 //   cout<<*t<<endl;
   se.erase(t);
   modify(1,pos,0);
   //cout<<se.count(1)<<endl;
  }
  cout<<"YES"<<endl;
  
}
signed main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  
  cin>>T;
  for(int i=1;i<=T;i++)
  {
    solve(i);
  }
}