#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());
int threshold = sorted_a[n - k - 1]; // (n-k)-th smallest strength (0-based)
bool possible = (a[j-1] >= threshold);
cout << (possible ? "YES" : "NO") << "\n";
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSB7CiAgICAgICAgaW50IG4sIGosIGs7CiAgICAgICAgY2luID4+IG4gPj4gaiA+PiBrOwogICAgICAgIHZlY3RvcjxpbnQ+IGEobik7CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICAgICAgY2luID4+IGFbaV07CiAgICAgICAgfQogICAgICAgIHZlY3RvcjxpbnQ+IHNvcnRlZF9hID0gYTsKICAgICAgICBzb3J0KHNvcnRlZF9hLmJlZ2luKCksIHNvcnRlZF9hLmVuZCgpKTsKICAgICAgICBpbnQgdGhyZXNob2xkID0gc29ydGVkX2FbbiAtIGsgLSAxXTsgLy8gKG4tayktdGggc21hbGxlc3Qgc3RyZW5ndGggKDAtYmFzZWQpCiAgICAgICAgYm9vbCBwb3NzaWJsZSA9IChhW2otMV0gPj0gdGhyZXNob2xkKTsKICAgICAgICBjb3V0IDw8IChwb3NzaWJsZSA/ICJZRVMiIDogIk5PIikgPDwgIlxuIjsKICAgIH0KICAgIHJldHVybiAwOwp9