#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],cnt[N],pos[N];
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;
		for(int i=1;i<=n;i++)cin>>a[i],pos[a[i]]=i;
		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);
		for(int i=n;i>=1;i--)
		{
			auto p=s.lower_bound(pos[i]);
			cnt[pos[i]]=*p-*prev(p)-1;
			s.insert(pos[i]);
		}
		int f=1;
		for(int i=1;i<=n;i++)
		{
			if(s1.count(a[i]))continue;
			auto it=s2.upper_bound(cnt[i]);
			if(it==s2.begin())
			{
				f=0;
				break;
			}
			it--;
			s2.erase(it);
		}
		if(f)cout<<"YES"<<endl;
		else cout<<"NO"<<endl;

	}

}