func_code_string: #include<cstdio>   #include<cstring>   #include<algorithm>   #include<iostream>   #include<string>   #include<vector>   #include<stack>   #include<bitset>   #include<cstdlib>   #include<cmath>   #include<set>   #include<list>   #include<deque>   #include<map>   #include<queue>      #define rep(i, a, n) for (ll  i=a;i<=n;i++)   #define per(i, a, n) for (ll  i=a;i>=n;i--)   #define IOS ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)   #pragma GCC optimize(3)//O3   #pragma GCC optimize(2)//O2   //#define endl   n    #define Mod(x) x % mod   #define toNum(x) x - 0    #define fi first   #define se second   #define mm(a, b) memset(a,b, sizeof(a));   #define dbg(x) cout << #x <<  =  << x << endl;   using namespace std;   typedef long long ll;   typedef unsigned long long ull;   typedef pair<ll, ll> PII;   const ll maxn = 3e6 + 10;   const ll mod = 1e9 + 7;   const ll N = 1e6 + 10;   const ll INF = 0x3f3f3f3f;   #define cf ll  t;cin>>t;while (t--) solve();   int n, m, sum, cnk, maxx, minn = INF, u, l, r, pre, op, p, k, z, ok, x, y, temp, q, sum1, sum2, A, B, cnt, ans, b, ask, t, nums, len;   char s[110];      void solve() {       cin >> n >> k >> s + 1;       sum = 0;       for (int i = 1, j = n; j > i; i++, j--) {           if (s[i] == s[j]) {               sum++;           } else break;       }       if(!(n & 1) && k == n / 2) puts( NO );       else if (k <= sum) puts( YES );       else puts( NO );   }      int main() {       IOS;       cf;       return 0;   }