#include <iostream>
#include <string>
using namespace std;

int KR,KB,maxv;
string s,k;
bool f[32];

void dfs(int i){
    if(i == s.size()){
        maxv = max(maxv, (int)k.size());
        return;
    }
    if(s[i] != 'W' && f[i]) dfs(i+1);
    int ks = k.size();
    if(
        (s[i] == 'R' && ( ks-KR < 0 || k[ks-KR] != 'R' )) ||
        (s[i] == 'B' && ( ks-KB < 0 || k[ks-KB] != 'B' )) || 
        (s[i] == 'W'))
    {
        k.push_back(s[i]);
        dfs(i+1);
        k.pop_back();
    }
}

int main(){
    cin >> KR >> KB >> s;
    for(int i = 0; i < s.size(); i++){
        if(s[i] == 'R' && i+KR < s.size() && s[i] == s[i+KR]){
            for(int j = i; j <= i+KR; j++) f[j] = true;
        }
        if(s[i] == 'B' && i+KB < s.size() && s[i] == s[i+KB]){
            for(int j = i; j <= i+KB; j++) f[j] = true;
        }
    }
    dfs(0);
    cout << maxv << endl;
}