#include "bits/stdc++.h"
using namespace std;
using ll = long long;

const ll N = 1e6 + 1;
const ll M = 1e9 + 7;

ll n, m, k;
ll a[N], b[N], l[N];
ll pp[N], tmp[N];

bool inorder() {
    ll j = 1;
    for (int i = 1; i <= n; i ++)
        if (a[i] == b[j]) j ++;
    return (j >= m + 1);
}

void buffalo() {
    for (int i = 1; i <= n; i ++) pp[a[i]] = 1;
    for (int i = 1; i <= m; i ++) pp[b[i]] = 0; 

    sort(l + 1, l + k + 1); k = n - m;
    for (int i = k; i >= 1; i --) {
        bool ok = 0; ll del;
        for (int j = l[i]; j <= n; j ++) {
            ll lc = j - l[i] + 1, rc = j, mx = -1e18;
            for (int x = lc; x <= rc; x ++) mx = max(mx, a[x]);
            if (pp[mx] == 1) {ok = 1; del = mx; break;}
        }
        if (!ok) {cout << "NO\n"; return;}
        
        ll sz = 0;
        for (int j = 1; j <= n; j ++)
            if (a[j] != del) tmp[++ sz] = a[j];
        n = sz;
        for (int j = 1; j <= n; j ++) 
            a[j] = tmp[j]; 
    }
    cout << "YES\n";
}

void doTest(ll testID) {
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i ++) cin >> a[i];
    for (int i = 1; i <= m; i ++) cin >> b[i];
    for (int i = 1; i <= k; i ++) cin >> l[i];

    if (k + m < n) {cout << "NO\n"; return;}
    if (!inorder()) {cout << "NO\n"; return;}
    
    buffalo();
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int test = 1; 
    cin >> test;
    for (int _ = 1; _ <= test; _ ++) doTest(test);
}