#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cerr<<#x<<' '<<x<<endl;
typedef pair<int,int>PII;
typedef long long LL;
constexpr int N=200010,mod=1e9+7;
int a[N],b[N],l[N],pre[N],pos[N];
struct BIT{
    vector<int>tr;
    BIT (){};
    BIT (int n):tr(n){};
    int lowbit(int x)
    {
        return x&-x;
    }
    void add(int x,int va)
    {
        for(int i=x;i<tr.size();i+=lowbit(i))tr[i]+=va;
    }
    int sum(int x)
    {
        int res=0;
        for(int i=x;i;i-=lowbit(i))res+=tr[i];
        return res;
    }
};

signed main()
{
	//freopen(".in","r",stdin);freopen(".out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		int n,m,k;
		cin>>n>>m>>k;
		BIT v(n+1);
		for(int i=1;i<=n;i++)cin>>a[i],pos[a[i]]=i,v.add(i,1);
		a[n+1]=n+1;
		set<int>s1,s2;
		for(int i=1;i<=m;i++)cin>>b[i],s1.insert(b[i]);
			
		for(int i=1;i<=k;i++)cin>>l[i],s2.insert(l[i]);
		set<int>s;
		s.insert(0);
		s.insert(n+1);
		int flag=1;
		for(int i=1,j=1;i<=m;i++)
		{
			while(j<=n&&a[j]!=b[i])j++;
			if(j>n)
			{
				flag=0;
				break;
			}
		}
		if(flag==0)
		{
			cout<<"NO"<<endl;
			continue;
		}
		int f=1;
		for(int i=n;i>=1;i--)
		{
			if(s1.count(i))
			{
				s.insert(pos[i]);
				continue;
			}
			auto p=s.lower_bound(pos[i]);
			int l=*prev(p),r=*p;
			int len=v.sum(r-1)-v.sum(l);
			auto it=s2.upper_bound(len);
			if(it==s2.begin())
			{
				f=0;
				break;
			}
			it--;
			v.add(pos[i],-1);
			s2.erase(it);
			s.insert(pos[i]);
		}
		if(f)cout<<"YES"<<endl;
		else cout<<"NO"<<endl;



	}

}