#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> players = a;
        sort(players.begin(), players.end());
        int pos = lower_bound(players.begin(), players.end(), a[j-1]) - players.begin();
        if (pos + k - 1 >= n) {
            cout << "NO\n";
            continue;
        }
        bool possible = false;
        for (int i = pos; i <= pos + k - 1 && i < n; i++) {
            if (players[i] == a[j-1]) {
                possible = true;
                break;
            }
        }
        cout << (possible ? "YES" : "NO") << "\n";
    }
    return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKICAgIGludCB0OwogICAgY2luID4+IHQ7CiAgICB3aGlsZSAodC0tKSB7CiAgICAgICAgaW50IG4sIGosIGs7CiAgICAgICAgY2luID4+IG4gPj4gaiA+PiBrOwogICAgICAgIHZlY3RvcjxpbnQ+IGEobik7CiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICAgICAgY2luID4+IGFbaV07CiAgICAgICAgfQogICAgICAgIHZlY3RvcjxpbnQ+IHBsYXllcnMgPSBhOwogICAgICAgIHNvcnQocGxheWVycy5iZWdpbigpLCBwbGF5ZXJzLmVuZCgpKTsKICAgICAgICBpbnQgcG9zID0gbG93ZXJfYm91bmQocGxheWVycy5iZWdpbigpLCBwbGF5ZXJzLmVuZCgpLCBhW2otMV0pIC0gcGxheWVycy5iZWdpbigpOwogICAgICAgIGlmIChwb3MgKyBrIC0gMSA+PSBuKSB7CiAgICAgICAgICAgIGNvdXQgPDwgIk5PXG4iOwogICAgICAgICAgICBjb250aW51ZTsKICAgICAgICB9CiAgICAgICAgYm9vbCBwb3NzaWJsZSA9IGZhbHNlOwogICAgICAgIGZvciAoaW50IGkgPSBwb3M7IGkgPD0gcG9zICsgayAtIDEgJiYgaSA8IG47IGkrKykgewogICAgICAgICAgICBpZiAocGxheWVyc1tpXSA9PSBhW2otMV0pIHsKICAgICAgICAgICAgICAgIHBvc3NpYmxlID0gdHJ1ZTsKICAgICAgICAgICAgICAgIGJyZWFrOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgICAgIGNvdXQgPDwgKHBvc3NpYmxlID8gIllFUyIgOiAiTk8iKSA8PCAiXG4iOwogICAgfQogICAgcmV0dXJuIDA7Cn0=

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