#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<set>

using i64 = long long;

vector<int> arr;

void update(int p){
	for(int i = p; i < arr.size(); i += i & -i){
		arr[i]++;
	}
	return;
}

int getsum(int p){
	int sum = 0;
	for(int i = p; i > 0; i -= i & -i){
		sum += arr[i];
	}
	return sum;
}

int getsum(int l, int r){
	return getsum(r) - getsum(l - 1);
}

const int N = 2e5 + 10;
vector<int> Log(N + 1);

void init(){
	for(int i = 2; i <= N; ++i) Log[i] = Log[i >> 1] + 1;
	return;
}

vector<vector<int>> st;
void build(vector<int>& t){
	int n = t.size();
	st.resize(n, vector<int>(Log[n] + 1, 0));

	for(int i = 0; i < n; ++i) st[i][0] = t[i];
	for(int i = 1; i <= Log[n]; ++i){
		int d = 1 << (i - 1);
		for(int j = 0; j + d < n; ++j){
			st[j][i] = max(st[j][i - 1], st[j + d][i - 1]);
			//cout << j << " " << i << " " << st[j][i] << "\n";
		}
	}

	return;
}

int tquery(int l, int r){
	int L = Log[r - l + 1];
	return max(st[l][L], st[r - (1 << L) + 1][L]);
}

void solve(){
	int n, m, k;
	cin >> n >> m >> k;

	arr.resize(n + 2);

	vector<int> a(n + 2), b(m + 1), p(n + 1);
	a[0] = a[n + 1] = 1e9;

	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		p[a[i]] = i;
		arr[i] = 0;
	}
	for(int i = 1; i <= m; ++i) cin >> b[i];

	multiset<int> s;
	for(int i = 1; i <= k; ++i) {
		int v = 0;
		cin >> v;
		s.insert(v);
	}

	if(k < n - m) {
		cout << "NO\n";
		return;
	}

	int tp = 1;
	for(int i = 1; i <= m; ++i){
		while(tp <= n && a[tp] != b[i]) ++tp;
	}

	if(tp == n + 1){
		cout << "NO\n";
		return;
	}

	s.insert(0), s.insert(1e9);

	vector<bool> vis(n + 2);
	for(int i = 1; i <= m; ++i){
		vis[b[i]] = true;
	}

	vector<int> l(n + 2), r(n + 2, n + 1);

	vector<int> t(n + 2);

	for(int i = 1; i <= n; ++i){
		if(vis[i]) t[p[i]] = i;
	}
	t[0] = t[n + 1] = 1e9;

	build(t);

	// cout << tquery(2, 3) << "\n";

	for(int i = 1; i <= n; ++i){
		if(vis[i]) l[p[i]] = r[p[i]] = p[i];
		else{
			int tl = 0, tr = p[i];
			while(tl + 1 < tr){
				int mid = (tl + tr) >> 1;
				(tquery(mid, p[i]) > i ? tl : tr) = mid;
				//cout << mid << " " << p[i] << " " << tquery(mid, p[i]) << "\n";
			}
			//cout << tl << " " << tr << "\n";
			l[p[i]] = tl;

			//cout << "daf\n";

			tl = p[i], tr = n + 1;
			while(tl + 1 < tr){
				int mid = (tl + tr) >> 1;
				(tquery(p[i], mid) > i ? tr : tl) = mid;
				//cout << p[i] << " " << mid << " " << tquery(p[i], mid) << "\n";
			}
			//cout << tl << " " << tr << "\n";
			r[p[i]] = tr;

			//cout << "daf\n";

			//cout << p[i] << " " << l[p[i]] << " " << r[p[i]] << "\n";
		}
	}

	l[0] = r[0] = 0;
	l[n + 1] = r[n + 1] = n + 1;

	// for(int i = 0; i <= n + 1; ++i){
	// 	cout << i << " " << l[i] << " " << r[i] << "\n";
	// }


	for(int i = n; i >= 1; --i){
		if(!vis[i]){
			int j = p[i];
			int q = getsum(l[j] + 1, r[j] - 1);
			auto t = prev(s.upper_bound(r[j] - l[j] - 1 - q));
			//cout << i << " " << l[i] << " " << r[i] << " " << q << " " << (*t) << "\n";
			if(*t == 0){
				cout << "NO\n";
				return;
			}
			else{
				s.extract(*t);
				update(j);
			}
		}
	}

	cout << "YES\n";

	return;
	
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	init();

	int t = 1;
	cin >> t;
	while(t--) solve();

	return 0;
}