#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double eps = 1e-10;

int s[30], st[60], k[2];
int search(int i, int sl){
  if(i==30){
    return sl;
  }
  if(s[i]==-1){
    st[sl] = -1;
    return search(i+1, sl+1);
  }
  if(st[sl - k[s[i]]] != s[i]){
    st[sl] = s[i];
    int r1 = search(i+1, sl+1);
    int r2 = search(i+1, sl);
    return max(r1, r2);
  }else{
    return search(i+1, sl);
  }
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> k[0] >> k[1];
  string ss;
  cin >> ss;
  FOR(i, 0, 30){
    switch(ss[i]){
      case 'R':
        s[i] = 0;
        break;
      case 'B':
        s[i] = 1;
        break;
      case 'W':
        s[i] = -1;
        break;
      default:
        break;
    }
    st[i] = -1;
  }
  cout << search(0, 30) - 30 << endl;
}