#include <bits/stdc++.h>
using namespace std;
 
int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, j, k;
        cin >> n >> j >> k;
        vector<int> a(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        vector<int> sorted_a = a;
        sort(sorted_a.begin(), sorted_a.end(), greater<int>());
        int threshold = sorted_a[k-1]; // k-th highest strength
        bool possible = (a[j-1] >= threshold);
        cout << (possible ? "YES" : "NO") << "\n";
    }
    return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSB7CiAgICAgICAgaW50IG4sIGosIGs7CiAgICAgICAgY2luID4+IG4gPj4gaiA+PiBrOwogICAgICAgIHZlY3RvcjxpbnQ+IGEobik7CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICAgICAgY2luID4+IGFbaV07CiAgICAgICAgfQogICAgICAgIHZlY3RvcjxpbnQ+IHNvcnRlZF9hID0gYTsKICAgICAgICBzb3J0KHNvcnRlZF9hLmJlZ2luKCksIHNvcnRlZF9hLmVuZCgpLCBncmVhdGVyPGludD4oKSk7CiAgICAgICAgaW50IHRocmVzaG9sZCA9IHNvcnRlZF9hW2stMV07IC8vIGstdGggaGlnaGVzdCBzdHJlbmd0aAogICAgICAgIGJvb2wgcG9zc2libGUgPSAoYVtqLTFdID49IHRocmVzaG9sZCk7CiAgICAgICAgY291dCA8PCAocG9zc2libGUgPyAiWUVTIiA6ICJOTyIpIDw8ICJcbiI7CiAgICB9CiAgICByZXR1cm4gMDsKfQ==

Mwo1IDIgMwozIDIgNCA0IDEKNSA0IDEKNSAzIDQgNSAyCjYgMSAxCjEgMiAzIDQgNSA2Cg==

3
5 2 3
3 2 4 4 1
5 4 1
5 3 4 5 2
6 1 1
1 2 3 4 5 6