#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define l(x) (x<<1)
#define r(x) (x<<1|1)
#define mpr make_pair
//mt19937_64 ra(time(0) ^ (*new char));
//ios::sync_with_stdio(false);
//cin.tie(0); cout.tie(0);
const int SIZE = 200005;
const int mod = 998244353;
int n, m, K, T;
int a[SIZE], b[SIZE];
int l[SIZE];
bool v[SIZE], used[SIZE];
int st[SIZE], top;
int nx[SIZE], pr[SIZE];
int c[SIZE];

inline int rd(){
	int x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9'){
		x = (x<<1) + (x<<3) + (ch^48);
		ch = getchar();
	}
	return x*f;
}

bool cmp(int x, int y){
	return a[x] > a[y];	
}

int lowbit(int x){
	return x & (-x);	
}

void add(int x, int val){
	for(int i = x; i <= n; i+=lowbit(i)) c[i] += val;	
}

int ask(int x){
	int jl = 0;
	for(int i = x; i; i-=lowbit(i)) jl += c[i];
	return jl;
}

int main(){
	T = rd();
	while(T--){
		n = rd(), m = rd(), K = rd();
		for(int i = 1; i <= n; i++) c[i] = 0;
		for(int i = 1; i <= n; i++) a[i] = rd(), v[i] = 1, add(i, 1);
		for(int i = 1; i <= m; i++) b[i] = rd(), v[b[i]] = 0;
		for(int i = 1; i <= K; i++) l[i] = rd(), used[i] = 0;
		sort(l+1, l+K+1); top = 0;
		for(int i = 1; i <= n; i++){
			if(v[a[i]]) st[++top] = i;
			v[a[i]] = 0;
		}
		v[0] = v[n+1] = 0;
		sort(st+1, st+top+1, cmp);
		bool ans = 1; 
		for(int i = 1; i <= top; i++){
			int prr = st[i]-1, nxx = st[i]+1;
			while((v[prr] || a[prr] < a[st[i]]) && prr >= 1) prr--;
			while((v[nxx] || a[nxx] < a[st[i]]) && nxx <= n) nxx++;
			prr++, nxx--;
//			cout << prr << " " << nxx << endl;
			int x = ask(nxx) - (prr==1?0:ask(prr-1)), jjl = 0;
//			cout << x << endl;
			for(int j = K; j >= 1; j--){
				if(l[j] > x || used[j]) continue;
				jjl = j; break;
			}
			if(jjl == 0){
				ans = 0;
				break;
			}
			used[jjl] = 1; v[st[i]] = 1; add(st[i], -1);
		}
		if(ans == 0){
			printf("NO\n");
			continue;
		}
		int now = 1;
		for(int i = 1; i <= n; i++){
			if(!v[i]){
				if(a[i] == b[now]) now++;
				else{
					ans = 0;
					break;
				}
			}
		}
		if(now != m+1) ans = 0;
		if(ans) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}
/*
6
10 5 6
5 6 9 10 7 1 3 2 4 8
5 6 9 1 2
8 9 9 10 10 10
10 6 5
5 6 7 2 4 8 10 9 1 3
5 2 8 9 1 3
9 7 7 10 10
5 3 4
3 5 4 1 2
4 1 2
3 5 4 5
6 3 5
6 1 2 5 4 3
1 4 3
4 5 5 5 4
10 8 5
7 3 1 5 9 8 2 6 10 4
3 1 5 9 8 2 6 4
6 1 4 8 10
10 6 4
7 1 4 5 8 9 3 10 2 6
1 4 8 3 2 6
2 1 2 1

NO
NO
NO
NO
YES
YES
*/