#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=l;i<=r;++i)
#define fd(i,r,l) for(int i=r;i>=l;--i)
#define ll long long
#define I inline int
#define V inline void
#define L inline ll
#define pi pair<int,int>
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define vii vector<pi>
using namespace std;
const int N=2e5+10;
I read() {
	int x=0,y=1;char c=getchar();
	while(c<48||c>57) {if(c==45)y=-y;c=getchar();}
	while(c>=48&&c<=57) x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*y;
}
char St;
int rt[N],tr1[N*20],ls[N*20],rs[N*20],cnt1,R[N],B[N],n,f[N];
int cnt2;
ll r,b,m1,m2,n1,n2;
struct tree {
	int ls,rs,x;
}tr[N*400];
V add(int &x,int l,int r,int px,int py) {
//	printf("1 %d %d\n",l,r);
	if(!x) x=++cnt2;
	if(l==r) return tr[x].x=py,void();
	int mid=l+r>>1;
	if(px<=mid) add(tr[x].ls,l,mid,px,py);
	else add(tr[x].rs,mid+1,r,px,py);
	tr[x].x=max(tr[tr[x].ls].x,tr[tr[x].rs].x);
}
V add(int &x,int l,int r,int px,int py,int pz) {
//	printf("2 %d %d\n",l,r);
	if(!x) x=++cnt1;
	add(tr1[x],n2,m2,py,pz);
	if(l==r) return ;
	int mid=l+r>>1;
	if(px<=mid) add(ls[x],l,mid,px,py,pz);
	else add(rs[x],mid+1,r,px,py,pz);
}
I ques(int x,int l,int r,int pl,int pr) {
//	printf("3");
	if(l>pr||r<pl||!x) return -1e9;
	if(l>=pl&&r<=pr) return tr[x].x;
	int mid=l+r>>1;
	return max(ques(tr[x].ls,l,mid,pl,pr),ques(tr[x].rs,mid+1,r,pl,pr));
}
I ques(int x,int l,int r,int pl,int pr,int ql,int qr) {
//	printf("4");
	if(l>pr||r<pl||!x) return -1e9;
	if(l>=pl&&r<=pr) return ques(tr1[x],n2,m2,ql,qr);
	int mid=l+r>>1;
	return max(ques(ls[x],l,mid,pl,pr,ql,qr),ques(rs[x],mid+1,r,pl,pr,ql,qr));
}
char col[N];
char Ed; 
int main() {
	cerr<<(&St-&Ed)/1024.0<<endl;
	n=read();r=read(),b=read();
	scanf("%s",col+1);
//	n=2e5;r=4e4;b=2e4;
//	fo(i,1,1.2e5) col[i]='R';
//	fo(i,120001,2e5) col[i]='B';
	m1=m2=-1e9;n1=n2=1e9;
	tr[0].x=-1e9;
	fo(i,1,n) {
		R[i]=R[i-1]+(col[i]=='R'),B[i]=B[i-1]+(col[i]=='B');
	}
	fo(i,0,n) {
		m1=max(m1,R[i]-r*i/(r+b));
		n1=min(n1,R[i]-r*i/(r+b));
		m2=max(m2,B[i]-b*i/(r+b));
		n2=min(n2,B[i]-b*i/(r+b));
	}
	int ans=0;
	fo(i,0,n) {
		int x=R[i]-(ll)r*i/(r+b),y=B[i]-(ll)b*i/(r+b);
		if(i<r+b) {
			f[i]=0;
			add(rt[i],n1,m1,x,y,-i);continue;
		}
		f[i]=max(ques(rt[i%(r+b)],n1,m1,x,m1,y,m2)+i,f[i-1]);
		add(rt[i%(r+b)],n1,m1,x,y,f[i]-i);
		ans=max(ans,f[i]);
	}
	printf("%lld\n",ans/(r+b));
	return 0;
}