#include <bits/stdc++.h>
#define N 2000011
#define ll long long
using namespace std;
int n,k;char s[N];ll res;
namespace part1
{
	set<int> A,B;
	void main()
	{
		for(int i=1;i<=2*n;++i)if(s[i]=='A')A.insert(i);else B.insert(i);
		for(int _=1;_<=n;++_)
		{
			int Ai=*A.begin(),Bi=*B.begin();
			if(Ai<Bi){A.erase(Ai);B.erase(Bi);continue;}
			res+=Ai-Bi;
			B.insert(Ai);
			B.erase(Bi);B.erase(Bi+1);
			A.erase(Ai);
			swap(s[Ai],s[Bi]);
		}
	}
};
struct ST{ll v;int w;ST(){v=1e18;w=0;}ST(ll _v,int _w){v=_v;w=_w;}};
ST dp[N];int h[N];ll sh[N];
bool operator<(ST a,ST b){return a.v<b.v||a.v==b.v&&a.w<b.w;}
ST operator+(ST a,ll b){return ST(a.v+b,a.w);}
void solve(ll K)
{
	for(int i=1;i<=2*n;++i)h[i]=h[i-1]+(s[i]=='A'?1:-1);
	for(int i=1;i<=2*n;++i)sh[i]=sh[i-1]+(h[i]+h[i-1]);
	for(int i=0;i<=2*n;++i)dp[i]=ST();
	dp[0]=ST(0,0);
	int t=0;
	for(int i=2;i<=2*n;i+=2)
	{
		while(h[t]<i-t)++t;
		for(int j=0;j<t;++j)
		{
			dp[i]=min(dp[i],dp[j-h[j]]+(1ll*(i-(j-h[j]))*(i-(j-h[j]))-2ll*(sh[t]-sh[j])-2ll*h[j]*h[j]-2ll*h[t]*h[t]+8*K)/8);
		}
		for(int j=t;j<i;++j)dp[i]=min(dp[i],dp[j-h[j]]+K);
		++dp[i].w;
	}
}
int main()
{
	scanf("%d%d%s",&n,&k,s+1);
	part1::main();
	ll L=0,R=1e12,ans=0;
	while(L<=R)
	{
		ll M=L+R>>1;
		solve(M);
		if(dp[2*n].w<=k)ans=M,R=M-1;else L=M+1;
	}
	solve(ans);
	printf("%lld\n",res+dp[2*n].v-ans*k);return 0;
}