// by Siddhid Saha (2112010)


#include <bits/stdc++.h>
using namespace std;

#define INF 1e18
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define PI atan(1)*4
#define set_bits __builtin_popcountllO
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll,ll>
#define rvsort(a) sort(all(a),greater<ll>())
#define read(a,n) for(int i = 0 ; i < n ; i ++){ cin >> a[i];}
#define printv(a) for(auto it: a){cout << it << " ";} cout << endl;
#define ms(arr, v) memset(arr, v, sizeof(arr))

typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*---------------------------------------------------------------------------------------------------------------------------*/
ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}
ll expo(ll a, ll b, ll mod) {ll res = 1; while (b > 0) {if (b & 1)res = (res * a) % mod; a = (a * a) % mod; b = b >> 1;} return res;}
void extendgcd(ll a, ll b, ll*v) {if (b == 0) {v[0] = 1; v[1] = 0; v[2] = a; return ;} extendgcd(b, a % b, v); ll x = v[1]; v[1] = v[0] - v[1] * (a / b); v[0] = x; return;} //pass an arry of size1 3
ll mminv(ll a, ll b) {ll arr[3]; extendgcd(a, b, arr); return arr[0];} //for non prime b
ll mminvprime(ll a, ll b) {return expo(a, b - 2, b);}
void google(int t) {cout << "Case #" << t << ": ";}
vector<ll> sieve(int n) {int*arr = new int[n + 1](); vector<ll> vect; for (int i = 2; i <= n; i++)if (arr[i] == 0) {vect.push_back(i); for (int j = 2 * i; j <= n; j += i)arr[j] = 1;} return vect;}
ll phin(ll n) {ll number = n; if (n % 2 == 0) {number /= 2; while (n % 2 == 0) n /= 2;} for (ll i = 3; i <= sqrt(n); i += 2) {if (n % i == 0) {while (n % i == 0)n /= i; number = (number / i * (i - 1));}} if (n > 1)number = (number / n * (n - 1)) ; return number;} //O(sqrt(N))
ll uid(ll l, ll r) {return uniform_int_distribution<ll>(l, r)(rng);} 
/*--------------------------------------------------------------------------------------------------------------------------*/

//const int mod = 1e9 + 7;
//const int mod = 998244353; 

const int maxN = 400005;

struct BIT{
    ll N;
    vll bit;
 
    void init(ll n){
        N = n;
        bit.assign(n+1 , 0);
    }
    void update(ll ind , ll val){
        while(ind <= N){
            bit[ind]+= val;
            ind += (ind & (-ind));
        }
    }
    ll psum(ll ind){
        ll ans = 0;
        while(ind > 0){
            ans += bit[ind];
            ind -= (ind & (-ind));
        }
        return ans;
    }
    ll rsum(ll l , ll r){
        return psum(r)-psum(l-1);
    }
    ll find(ll val){
        ll curr = 0  , prevsum = 0;
        for(int i = log2(N) ; i >= 0 ; i --){
            if(curr + (1 << i) < N && prevsum + bit[curr + (1 << i)]  < val){
                prevsum  += bit[curr + (1 << i)];
                curr  += (1 << i);
            }
        }
        return curr + 1;
    }
    void prints(void){
        printv(bit);
    }
};

multiset<ll> mst1 , mst2;
vll posa, posb , a , b , vis;

void solve()
{
    ll n , m , k; cin >> n >> m >> k;
    BIT bt; bt.init(maxN);
    mst1.clear(); mst2.clear(); a.clear(); b.clear(); posa.clear(); posb.clear();
    a.resize(n+1) , posa.resize(n+1),posb.resize(n+1), b.resize(m+1);
    for(int i = 1 ; i<= n ; i++){
        cin >> a[i];
        posa[a[i]]=i;
    }
    for(int i = 1; i <= m ;i ++){
        cin >> b[i];
        posb[b[i]]=i; 
    } 
    for(int i = 1 ; i <= n ; i ++){
        bt.update(i , 1);
    }
    for(int i = 0 ; i < k ; i ++){
        ll x; cin >> x; mst1.insert(x);
    }
    mst2.insert(0);
    mst2.insert(n+1);
    for(int i = 1; i< m; i ++){
        if(posa[b[i]] > posa[b[i+1]]){
            cout << "NO" << endl;
            return;
        }
    }
    for(int i = n; i > 0; i--){
		if (posb[i]){
            mst2.insert(posa[i]);
        }else {
			int r = *mst2.lower_bound(posa[i]);
			int l = *--mst2.lower_bound(posa[i]);
			int len = bt.rsum(l + 1, r - 1);
			auto tmp = mst1.upper_bound(len);
			if (tmp == mst1.begin()) {
				cout << "NO" << endl;
                return;
			}
			mst1.erase(--tmp);
            bt.update(posa[i] , -1);
		}
	}
	cout << "YES" << endl;
    
   

}

int main() {

ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);


ll t = 1;
cin >> t;
for(int i = 1 ; i <= t ; i++){
//google(i);
solve();
}
return 0;
}