#include<bits/stdc++.h>

using namespace std;

#define int long long

using vi = vector<int>;

#define lowbit(x) ( x & - x )

struct BinaryIndexedTree {
    int n;
    vi b;

    BinaryIndexedTree(int n = 1) : n(n), b(n + 1, 0) {}

    void update(int i, int y) {
        for (; i <= n; i += lowbit(i)) b[i] += y;
    }

    int calc(int i) {
        int sum = 0;
        for (; i; i -= lowbit(i)) sum += b[i];
        return sum;
    }

    int calc(int l, int r) {
        assert(l <= r);
        if (l == 0) return calc(r);
        return calc(r) - calc(l - 1);
    }
};

void solve() {
    set<int> st, length;
    int n, m, k;
    cin >> n >> m >> k;
    vi a(n + 1), b(m + 1);
    vi vis(n + 1), pos(n + 1);
    for (int i = 1; i <= n; i++)
        cin >> a[i], pos[a[i]] = i;
    for (int i = 1; i <= m; i++)
        cin >> b[i], vis[b[i]] = 1;
    for (int i = 1, x; i <= k; i++)
        cin >> x, length.insert(x);

    // 判断顺序不对
    for (int i = 1, j = 1; i <= m; i++) {
        while (j <= n and a[j] != b[i]) j++;
        if (j > n) {
            cout << "NO\n";
            return;
        }
    }

    BinaryIndexedTree bit(n);
    for (int i = 1; i <= n; i++)
        bit.update(i, 1);
    st.insert(0), st.insert(n + 1);

    for (int i = n; i >= 1; i--) { // 枚举值
        if (vis[i]) {
            st.insert(pos[i]);
            continue;
        }
        auto ps = st.lower_bound(pos[i]);
        int l = *prev(ps), r = *ps;
        int len = bit.calc(r - 1) - bit.calc(l);
        bit.update(pos[i], -1);
        auto it = length.upper_bound(len);
        if (it == length.begin()) {
            cout << "NO\n";
            return;
        }
        length.erase(--it);
    }
    cout << "YES\n";
    return;
}

int32_t main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int TC;
    for (cin >> TC; TC; TC--)
        solve();
    return 0;
}