#include <bits/stdc++.h>

using namespace std;

template <unsigned M_> struct ModInt {
    static constexpr unsigned M = M_;
    unsigned x;
    constexpr ModInt() : x(0) {}
    constexpr ModInt(unsigned x_) : x(x_ % M) {}
    constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
    constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
    constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
    ModInt &operator+=(const ModInt &a) {
        x = ((x += a.x) >= M) ? (x - M) : x;
        return *this;
    }
    ModInt &operator-=(const ModInt &a) {
        x = ((x -= a.x) >= M) ? (x + M) : x;
        return *this;
    }
    ModInt &operator*=(const ModInt &a) {
        x = (static_cast<unsigned long long>(x) * a.x) % M;
        return *this;
    }
    ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
    ModInt pow(long long e) const {
        if (e < 0)
            return inv().pow(-e);
        ModInt a = *this, b = 1;
        for (; e; e >>= 1) {
            if (e & 1)
                b *= a;
            a *= a;
        }
        return b;
    }
    ModInt inv() const {
        unsigned a = M, b = x;
        int y = 0, z = 1;
        for (; b;) {
            const unsigned q = a / b;
            const unsigned c = a - q * b;
            a = b;
            b = c;
            const int w = y - static_cast<int>(q) * z;
            y = z;
            z = w;
        }
        assert(a == 1);
        return ModInt(y);
    }
    ModInt operator+() const { return *this; }
    ModInt operator-() const {
        ModInt a;
        a.x = x ? (M - x) : 0;
        return a;
    }
    ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
    ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
    ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
    ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
    template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
    template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
    template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
    template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
    explicit operator bool() const { return x; }
    bool operator==(const ModInt &a) const { return (x == a.x); }
    bool operator!=(const ModInt &a) const { return (x != a.x); }
    friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
// using mint = ModInt<1000000007U>;
using mint = ModInt<998244353U>;

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a(n), b(m);
    vector<int> pos_a(n + 1);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        pos_a[a[i]] = i;
    }
    vector<int> to_delete(n + 1, 1);
    for (int i = 0; i < m; i++) {
        cin >> b[i];
        to_delete[b[i]] = 0;
    }
    multiset<int> tools;
    for (int i = 0; i < k; i++) {
        int l;
        cin >> l;
        tools.insert(l);
    }

    vector<int> fenw(n);
    auto add = [&](int pos) {
        for (; pos < n; pos |= pos + 1)
            fenw[pos]++;
    };
    auto get = [&](int l, int r) {
        auto pref = [&](int pos) {
            int res = 0;
            for (; pos >= 0; pos = (pos & (pos + 1)) - 1)
                res += fenw[pos];
            return res;
        };
        return pref(r) - pref(l - 1);
    };
    set<int> pts;
    pts.insert(-1);
    pts.insert(n);
    for (int val = n; val >= 1; val--) {
        if (!to_delete[val]) {
            pts.insert(pos_a[val]);
            continue;
        }
        int to = *pts.upper_bound(pos_a[val]);
        int from = *prev(pts.upper_bound(pos_a[val]));
        int len = to - from - 1 - get(to - 1, from + 1);
        auto it = tools.upper_bound(len);
        if (it != tools.begin()) {
            tools.erase(prev(it));
        } else {
            cout << "NO\n";
            return;
        }
        add(pos_a[val]);
    }
    int cur = 0;
    for (int i = 0; i < n; i++)
        if (cur < m && a[i] == b[cur])
            cur++;
    if (cur == m)
        cout << "YES\n";
    else
        cout << "NO\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    for (int tc = 1; tc <= T; tc++) {
        solve();
    }
    return 0;
}