#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
const int MAXN = 5e3 + 5;
int n,k;
string s;
int pozb[MAXN];
int dp[MAXN], cnt_songs[MAXN];
int auxdp[MAXN];
pair<int, int> solve(int coef)//{{rez_coef, {nr_swaps, cnt_songs}}
{
dp[0] = 0;
cnt_songs[0] = 0;
int lim = 0;
for(int i=1;i<=n;i++)
{
while(lim + 1 <= i && pozb[lim + 1] < i)
lim++;
dp[i] = INF;
cnt_songs[i] = -1;
/*for(int old=i-1;old>=0;old--)
{
int aux = 0;
for(int u=old+1;u<=i;u++)
aux += max(0LL, i - pozb[u]);
int cv = dp[old] + coef + aux;
if(cv < dp[i])
{
dp[i] = cv;
cnt_songs[i] = cnt_songs[old] + 1;
}
}*/
//transition from i-1 to i
auxdp[i-1] = dp[i-1] + coef;
for(int x=0;x<i;x++)
auxdp[x] += max(0LL, (i-1) - pozb[i]);
for(int x=0;x<lim;x++)
auxdp[x] += lim - x;
for(int x=i-1;x>=0;x--)
{
if(auxdp[x] < dp[i])
{
dp[i] = auxdp[x];
cnt_songs[i] = cnt_songs[x] + 1;
}
}
}
return {dp[n], cnt_songs[n]};
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>k>>s;
assert(s.size() == 2 * n);
int cnta = 0, cntb = 0;
for(int i=0;i<2*n;i++)
{
if(s[i] == 'A')
{
cnta++;
}
else
{
cntb++;
pozb[cntb] = cnta;
}
}
assert(cnta == n && cntb == n);
int st = 0, dr = 1e9, ans = -1;
while(st <= dr)
{
int mij = (st + dr) / 2;
auto x = solve(mij);
if(x.second >= k)
{
ans = mij;
st = mij + 1;
}
else
{
dr = mij - 1;
}
}
assert(ans != -1);
auto x = solve(ans);
cout<<x.first - k * ans;
return 0;
}
