/*
* Copyright (c) 2024 Emon Thakur
* All rights reserved.
*/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using minheap = priority_queue<long long, vector<long long>, greater<long long>>;
typedef tree<int, null_type, greater_equal<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key
#define ll long long
#define ld long double
#define MOD 1000000007
#define pie 2*(acos(0.0))
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
#define endl '\n'
#define lcm(a,b) (a*b)/(__gcd<ll>(a,b))
#define print(v) for(auto e:v) cout<<e<<" "; cout<<endl;
#define printp(v) for(auto e:v) cout<<e.first<<" "<<e.second<<endl;
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define life_is_a_race ios::sync_with_stdio(false); cin.tie(nullptr);
void solve(int tc)
{
//cout<<"Case "<<tc<<": ";
ll n,k; cin >> n >> k;
string s; cin >> s;
ll a=0,b=0,q=0;
ll right[n][3],leftA[n];
for(int i=n-1;i>=0;i--)
{
right[i][0] = a;
right[i][1] = b;
right[i][2] = q;
a += (s[i]=='A');
b += (s[i]=='B');
q += (s[i]=='?');
}
a=0; b=0; q=0;
for(int i=0;i<n;i++)
{
leftA[i] = a;
if(s[i]=='A') ++a;
else if(s[i]=='B') ++b;
else if(s[i]=='?')
{
if(right[i][2] >= k) continue;
if(!k) continue;
if(a < right[i][1]) ++a, s[i]='A',--k;
else
{
if(right[i][2] >= k) continue;
else
{
s[i] = 'B'; ++b; --k;
}
}
}
}
ll ans = 0;
for(int i=n-1;i>=0;i--)
{
if(s[i]=='B') ans += leftA[i];
}
cout << ans << endl;
}
ll countans(ll mid,ll k,ll n,string s,vector<ll>&lftA,vector<ll>&qtn)
{
ll ans = 0,c=0,a=0;
for(int i=0;i<n;i++)
{
lftA[i] = a;
if(s[i]=='?' && mid!=-1 && i<=qtn[mid]) s[i]='A', ++c, ++a;
else if(s[i]=='A') ++a;
}
for(int i=n-1;i>=0;i--)
{
if(s[i]=='B') ans += lftA[i];
else if(s[i]=='?' && k-c) s[i]='B', ++c , ans += lftA[i];
}
return ans;
}
void solve2()
{
ll n,k; cin >> n >> k;
string s; cin >> s;
vector<ll> qtn;
for(int i=0;i<n;i++)
{
if(s[i]=='?') qtn.push_back(i);
}
ll lo=0,hi=min(k-1,(ll)qtn.size()),mid,ans=0;
ll lt,rt,md;
vector<ll>lftA(n);
while(lo<=hi)
{
mid = (lo+hi)/2;
lt = 0; rt = 0;
lt = countans(mid-1,k,n,s,lftA,qtn);
md = countans(mid,k,n,s,lftA,qtn);
if(mid < min(k-1,(ll)qtn.size())) rt = countans(mid+1,k,n,s,lftA,qtn);
ans = max({ans,lt,md,rt});
if(lt < md) lo=mid+1;
else if(rt < md) hi = mid-1;
else if(rt > md) lo = mid+1;
else if(lt > md) hi = mid-1;
else break;
}
cout << ans << endl;
}
int main()
{
life_is_a_race
int t=1;
cin>>t;
for(int i=1;i<=t;i++) solve2();
}