#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
const int N=3e5,M=8.8e7;
namespace Kazemaru{
struct xds{int ls,rs,c;}a[M];int t;
#define mid (L+R)/2
void add0(int&id,int L,int R,int x,int c){
	if(!id)id=++t;if(L==R)return a[id].c=max(a[id].c,c),void();
	x>mid?add0(a[id].rs,mid+1,R,x,c):add0(a[id].ls,L,mid,x,c);
	a[id].c=max(a[a[id].ls].c,a[a[id].rs].c);
}
int ask0(int id,int L,int R,int x){
	if(!id||R<x)return 0;if(x<=L)return a[id].c;
	return max(ask0(a[id].ls,L,mid,x),ask0(a[id].rs,mid+1,R,x));
}
void add1(int&id,int L,int R,int x,int y,int c){
	if(!id)id=++t;add0(a[id].c,0,n,y,c);if(L==R)return;
	x>mid?add1(a[id].rs,mid+1,R,x,y,c):add1(a[id].ls,L,mid,x,y,c);
}
int ask1(int id,int L,int R,int x,int y){
	if(!id||R<x)return 0;if(x<=L)return ask0(a[id].c,0,n,y);
	return max(ask1(a[id].ls,L,mid,x,y),ask1(a[id].rs,mid+1,R,x,y));
}
#undef mid
}using Kazemaru::ask1;
string S;
int f[N],g[N];ll x[N],y[N],z[N],R,G,B;
inline void put(int i,int w){f[i]=w;Kazemaru::add1(g[i%G],0,n,x[i],y[i],w-i);}
signed main(){
	cin>>n>>R>>B>>S;G=R+B;
	f(i,1,n)x[i]=x[i-1]+(S[i-1]=='R');
	f(i,1,n)y[i]=y[i-1]+(S[i-1]=='B');
	f(i,0,n)x[i]=x[i]*G-i*R,y[i]=y[i]*G-i*B;
	#define lsh(a)f(i,0,n)z[i]=a[i];sort(z,z+n+1);f(i,0,n)a[i]=lower_bound(z,z+n+1,a[i])-z;
	lsh(x);lsh(y);put(0,M);
	f(i,1,n)put(i,max(f[i-1],Kazemaru::ask1(g[i%G],0,n,x[i],y[i])+i));
	cout<<(f[n]-M)/G<<endl;
	return 0;
}