#include <iostream>
#include <vector>
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];
}
// Player j has 0-indexed position j-1
int player_j_strength = a[j-1];
// Count players with strength strictly greater than player j
int stronger_players = 0;
for (int i = 0; i < n; i++) {
if (a[i] > player_j_strength) {
stronger_players++;
}
}
// Player j can be in top k if there are at most k-1 players stronger than j
if (stronger_players <= k - 1) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgCiAgICB3aGlsZSAodC0tKSB7CiAgICAgICAgaW50IG4sIGosIGs7CiAgICAgICAgY2luID4+IG4gPj4gaiA+PiBrOwogICAgICAgIAogICAgICAgIHZlY3RvcjxpbnQ+IGEobik7CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICAgICAgY2luID4+IGFbaV07CiAgICAgICAgfQogICAgICAgIAogICAgICAgIC8vIFBsYXllciBqIGhhcyAwLWluZGV4ZWQgcG9zaXRpb24gai0xCiAgICAgICAgaW50IHBsYXllcl9qX3N0cmVuZ3RoID0gYVtqLTFdOwogICAgICAgIAogICAgICAgIC8vIENvdW50IHBsYXllcnMgd2l0aCBzdHJlbmd0aCBzdHJpY3RseSBncmVhdGVyIHRoYW4gcGxheWVyIGoKICAgICAgICBpbnQgc3Ryb25nZXJfcGxheWVycyA9IDA7CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICAgICAgaWYgKGFbaV0gPiBwbGF5ZXJfal9zdHJlbmd0aCkgewogICAgICAgICAgICAgICAgc3Ryb25nZXJfcGxheWVycysrOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgICAgIAogICAgICAgIC8vIFBsYXllciBqIGNhbiBiZSBpbiB0b3AgayBpZiB0aGVyZSBhcmUgYXQgbW9zdCBrLTEgcGxheWVycyBzdHJvbmdlciB0aGFuIGoKICAgICAgICBpZiAoc3Ryb25nZXJfcGxheWVycyA8PSBrIC0gMSkgewogICAgICAgICAgICBjb3V0IDw8ICJZRVNcbiI7CiAgICAgICAgfSBlbHNlIHsKICAgICAgICAgICAgY291dCA8PCAiTk9cbiI7CiAgICAgICAgfQogICAgfQogICAgCiAgICByZXR1cm4gMDsKfQ==