#include<cstdio>
#include<vector>


using namespace std;


using s_t=vector<int>;

int kr, kb;


int max_u(int& m, int v)
{
	if(m<v)
	{
		m=v;
		return 1;
	}
	return 0;
}


int solve(s_t& s, int& result)
{
	int i, n, is_ok=1;

	n=s.size();
	if(n<=result) return result;

	for(i=0;i<n;i++)
	{
		if(s[i]=='R')
		{
			if(i+kr<n && s[i+kr]=='R') is_ok=0;
		}
		if(s[i]=='B')
		{
			if(i+kb<n && s[i+kb]=='B') is_ok=0;
		}
	}
	if(is_ok) return n;

	if(n-1<=result) return result;

	for(i=0;i<n;i++)
	{
		if(s[i]=='W') continue;
		if(i>0 && s[i]==s[i-1]) continue;
		s_t w;
		w=s;
		w.erase(w.begin()+i);
		if(max_u(result, solve(w, result)))
		{
//			printf("result=%d\n", result);
		}
	}

	return result;
}


int main(void)
{
	char cs[30+2];
	s_t s;
	int result;

	while(scanf("%d%d%s", &kr, &kb, cs)==3)
	{
		s.clear();
		for(int i=0;cs[i];i++)
		{
			s.push_back(cs[i]);
		}

		result=0;
		printf("%d\n", solve(s, result));
	}

	return 0;
}