//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
//#pragma GCC optimize("Ofast","unroll-loops","inline")
#include<bits/stdc++.h>
#define ll long long
//#define int ll
#define pb push_back
using namespace std;
const int N=2e5+10,LGN=22;
const int Inf=1e9;
int n,ca,cb;
struct Seg{
	int s[N*400],lc[N*400],rc[N*400],cnt;
	inline void upd(int &rt,int l,int r,int p,int v){
		if(!rt) rt=++cnt,s[rt]=-Inf;
		s[rt]=max(s[rt],v);
		if(l==r) return ;
		int mid=(l+r)>>1;
		if(p<=mid) upd(lc[rt],l,mid,p,v);
		else upd(rc[rt],mid+1,r,p,v);
	}
	int qry(int rt,int l,int r,int ql,int qr){
		if(!rt) return -Inf;
		if(ql<=l&&r<=qr) return s[rt];
		int mid=(l+r)>>1,res=-Inf;
		if(ql<=mid) res=qry(lc[rt],l,mid,ql,qr);
		if(qr>mid) res=max(res,qry(rc[rt],mid+1,r,ql,qr));
		return res;
	}
}tr;
int tot,s[N*LGN],lc[N*LGN],rc[N*LGN];
inline void upd(int &rt,int l,int r,int p,int q,int v){
	if(!rt) rt=++tot;
	tr.upd(s[rt],1,n+1,q,v);
	if(l==r) return ;
	int mid=(l+r)>>1;
	if(p<=mid) upd(lc[rt],l,mid,p,q,v);
	else upd(rc[rt],mid+1,r,p,q,v);
}
int qry(int rt,int l,int r,int ql,int qr,int pl,int pr){
	if(!rt) return -Inf;
	if(ql<=l&&r<=qr) return tr.qry(s[rt],1,n+1,pl,pr);
	int mid=(l+r)>>1,res=-Inf;
	if(ql<=mid) res=qry(lc[rt],l,mid,ql,qr,pl,pr);
	if(qr>mid) res=max(res,qry(rc[rt],mid+1,r,ql,qr,pl,pr));
	return res; 
}
int r,b,t,f[N],Rt[N];
ll F[N],G[N],A[N],B[N];
char ch[N];
signed main(){
//	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>r>>b>>(ch+1);t=r+b;
	for(int i=1;i<=n;i++) F[i]=F[i-1]+(ch[i]=='B');
	for(int i=1;i<=n;i++) G[i]=G[i-1]+(ch[i]=='R');
	for(int i=1;i<=n;i++) F[i]=F[i]-i/t*b,G[i]=G[i]-i/t*r;
	for(int i=1;i<=n;i++) A[i+1]=F[i],B[i+1]=G[i];
	A[1]=B[1]=0;
	sort(A+1,A+n+2);ca=unique(A+1,A+n+2)-A-1;
	sort(B+1,B+n+2);cb=unique(B+1,B+n+2)-B-1;
	for(int i=0;i<=n;i++) F[i]=lower_bound(A+1,A+ca+1,F[i])-A,assert(1<=F[i]&&F[i]<=ca);
	for(int i=0;i<=n;i++) G[i]=lower_bound(B+1,B+cb+1,G[i])-B,assert(1<=G[i]&&G[i]<=cb);
	for(int i=0;i<t;i++){
		f[i]=0;upd(Rt[i],1,n+1,F[i],G[i],0);
	}
	for(int i=t;i<=n;i++){
		f[i]=max(f[i-1],(i/t)+qry(Rt[i%t],1,n+1,F[i],n+1,G[i],n+1));
		upd(Rt[i%t],1,n+1,F[i],G[i],f[i]-(i/t));
	}
	cout<<f[n]<<'\n';
	return 0;
}
/*
*/