/*

Author: Haze

2024/3/17

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll read() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

void solve() {
    int n = read(), m = read(), k = read();
    multiset<int>tool;
    vector<int>a(n), b(m), remain(n), toleft(n), toright(n), len(n);
    irep(i, 0, n - 1){
        a[i] = read();
    }
    irep(i, 0, m - 1){
        b[i] = read();
    }
    irep(i, 0, k - 1){
        tool.emplace(read());
    }
    auto it0 = b.begin();
    irep(i, 0, n - 1){
        if(*it0 == a[i]){
            remain[i] = 1;
            ++ it0;
        }
        if(it0 == b.end())break;
    }
    if(it0 != b.end()){
        puts("NO");
        return;
    }
    // val, idx
    priority_queue<pair<int,int>, vector<pair<int, int>>, greater<>>q;
    irep(i, 0, n - 1){
        if(remain[i] == 1){
            while(q.size()){
                auto [val, idx] = q.top();
                if(val > a[i])break;
                q.pop();
                toright[idx] = i;
            }
        }
        else{
            q.push(make_pair(a[i], i));
        }
    }
    while(q.size()){
        auto [val, idx] = q.top();
        q.pop();
        toright[idx] = n;
    }
    // --------------------------------------------
    drep(i, n - 1, 0){
        if(remain[i] == 1){
            while(q.size()){
                auto [val, idx] = q.top();
                if(val > a[i])break;
                q.pop();
                toleft[idx] = i + 1;
            }
        }
        else{
            q.push(make_pair(a[i], i));
        }
    }
    while(q.size()){
        auto [val, idx] = q.top();
        q.pop();
        toleft[idx] = 0;
    }
    vector<int>to;
    irep(i, 0, n - 1){
        if(remain[i] == 0){
//            cout << toright[i] - toleft[i] << ' ';
//            to.push_back(toright[i] - toleft[i]);
            auto it = tool.upper_bound(toright[i] - toleft[i]);
            if(it == tool.begin()){
                puts("NO");
                return;
            }
            -- it;

//            if(it == tool.end()){
//                puts("NO");
//
////                return;
//            }
            tool.extract(it);
        }
    }
//    cerr << endl;
    puts("YES");
}

int main() {
    // IOS
    int T = read();
    while (T--) {
        solve();
    }
    return 0;
}