#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <random>

using namespace std;

void solve() {
    int n, k1, k2;
    cin >> n >> k1 >> k2;
    int m1 = 0;
    int m2 = 0;
    while (k1--) {
        int x;
        cin >> x;
        m1 = max(m1, x);
    }
    while (k2--) {
        int x;
        cin >> x;
        m2 = max(m2, x);
    }
    if (m1 > m2) {
        cout << "YES\n";
    } else {
        cout << "NO\n";
    }
}

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

    int q;
    cin >> q;
    while (q--) {
        solve();
    }
}