#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
int t; cin >> t;
while (t--) {
int n, k; cin >> n >> k;
vector<int> a(n);
for (int &x : a) cin >> x;
vector<int> b(a);
sort(b.begin(), b.end());
int target = b[k - 1];
vector<int> c;
for (int x : a) {
if (x <= target) c.push_back(x);
}
int rem = (int) c.size();
int l = 0, r = rem - 1;
bool works = true;
while (l <= r) {
if (c[l] != c[r]) {
if (c[l] == target) {
rem--;
l++;
} else if (c[r] == target) {
rem--;
r--;
} else {
works = false;
break;
}
} else {
l++;
r--;
}
}
cout << ((works && rem >= k - 1) ? "YES" : "NO") << '\n';
}
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgljaW4udGllKDApLT5zeW5jX3dpdGhfc3RkaW8oMCk7CglpbnQgdDsgY2luID4+IHQ7Cgl3aGlsZSAodC0tKSB7CgkJaW50IG4sIGs7IGNpbiA+PiBuID4+IGs7CgkJdmVjdG9yPGludD4gYShuKTsKCQlmb3IgKGludCAmeCA6IGEpIGNpbiA+PiB4OwoJCXZlY3RvcjxpbnQ+IGIoYSk7CgkJc29ydChiLmJlZ2luKCksIGIuZW5kKCkpOwoJCWludCB0YXJnZXQgPSBiW2sgLSAxXTsKCgkJdmVjdG9yPGludD4gYzsKCQlmb3IgKGludCB4IDogYSkgewoJCQlpZiAoeCA8PSB0YXJnZXQpIGMucHVzaF9iYWNrKHgpOwoJCX0KCgkJaW50IHJlbSA9IChpbnQpIGMuc2l6ZSgpOwoKCQlpbnQgbCA9IDAsIHIgPSByZW0gLSAxOwoJCWJvb2wgd29ya3MgPSB0cnVlOwoJCXdoaWxlIChsIDw9IHIpIHsKCQkJaWYgKGNbbF0gIT0gY1tyXSkgewoJCQkJaWYgKGNbbF0gPT0gdGFyZ2V0KSB7CgkJCQkJcmVtLS07CgkJCQkJbCsrOwoJCQkJfSBlbHNlIGlmIChjW3JdID09IHRhcmdldCkgewoJCQkJCXJlbS0tOwoJCQkJCXItLTsKCQkJCX0gZWxzZSB7CgkJCQkJd29ya3MgPSBmYWxzZTsKCQkJCQlicmVhazsKCQkJCX0KCQkJfSBlbHNlIHsKCQkJCWwrKzsKCQkJCXItLTsKCQkJfQoJCX0KCQljb3V0IDw8ICgod29ya3MgJiYgcmVtID49IGsgLSAxKSA/ICJZRVMiIDogIk5PIikgPDwgJ1xuJzsKCX0KfQoKCg==