#include<bits/stdc++.h>
#define int long long
using namespace std;
int Read(){
	int x=0;
	char ch=getchar();bool f=0;
	while(ch<'0'||ch>'9') if(ch=='-')f=1,ch=getchar(); else if(ch==EOF)return 0; else ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return f?-x:x;
}
int a[202205];
int pos[202205];
int b[202205];
bool c[202205];
int pre[202205];
int aft[202205];
int stk[202205];
int n;
int s[202205];
int lowbit(int x){
	return x&(-x);
}
void update(int x){
	for(;x<=n+100;x+=lowbit(x))
		s[x]+=1;
}
int query(int x){
	int ans=0;
	for(;x;x-=lowbit(x)) ans+=s[x];
	return ans;
}
int s2[202205];
void update2(int x,int y){
	for(;x<=n+100;x+=lowbit(x))
		s2[x]+=y;
}
int query2(int x){
	int ans=0;
	for(;x;x-=lowbit(x)) ans+=s2[x];
	return ans;
}
int res;
signed main(){
	int T=Read();
	for(int t=1;t<=T;t++){
		set<int>::iterator it;
		n=Read();int m=Read(),k=Read();
		for(int i=1;i<=n;i++){
			a[i]=Read(),pos[a[i]]=i,s[i]=0,s2[i]=0;
		}
		for(int i=n;i<=2*n;i++) s[i]=0,s2[i]=0;
		for(int i=1;i<=m;i++){
			b[i]=Read();
		}
		int p1=1;
		b[m+1]=0; 
		for(int i=1;i<=n;i++){
			if(a[i]==b[p1]) c[i]=1,p1++;
			else c[i]=0;
		}
		for(int i=1;i<=k;i++){
			int d=Read();update2(d,1);
		}
		if(p1!=m+1){
			printf("NO\n");
			continue;
		}
		res=1;
		stk[1]=0;
		for(int i=1;i<=n;i++){
			if(c[i]){
				while(stk[res]<a[i]&&res)res--;
				stk[++res]=a[i];
			}else{
				int l=1,r=res;
				pre[i]=0;
				while(l<=r){
					int mid=(l+r)>>1;
					if(stk[mid]>a[i])pre[i]=pos[stk[mid]],l=mid+1;
					else r=mid-1;
				} 
			}
		}
		res=1;
		stk[1]=0;
		for(int i=n;i>=1;i--){
			if(c[i]){
				while(stk[res]<a[i]&&res)res--;
				stk[++res]=a[i];
			}else{
				int l=1,r=res;
				aft[i]=n+1;
				while(l<=r){
					int mid=(l+r)>>1;
					if(stk[mid]>a[i]) aft[i]=pos[stk[mid]],l=mid+1;
					else r=mid-1;
				} 
			}
		}
		bool flag=1;
		for(int i=n;i>=1;i--){
			if(!c[pos[i]]){
				int len=aft[pos[i]]-pre[pos[i]]-1;
				int mis=query(aft[pos[i]])-query(pre[pos[i]]);
				len-=mis;
				int pt=query2(len);
				if(pt<=0){
					printf("NO\n");
					flag=0;
					break;
				}
				int lft=1,rgt=len;
				int aim=0;
				while(lft<=rgt){
					int mid=(lft+rgt)>>1;
					if(query2(mid)==pt) aim=mid,rgt=mid-1;
					else lft=mid+1;
				}
				update2(aim,-1);
				update(pos[i]);
			}
		}
		if(flag)printf("YES\n");
	}
	return 0; 
}