#include <bits/stdc++.h>
using namespace std;
int Qread()
{
	int x=0;char ch=getchar();
	while(ch<'0'||ch>'9') ch=getchar();
	while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=getchar();
	return x;
}
char get_ch()
{
	char ch=getchar();
	while(ch<'A'||ch>'Z') ch=getchar();
	return ch;
}

struct Node{
	int lson,rson;
	int mx;
}s[80000010];
int poi_cnt;
#define ls s[pos].lson
#define rs s[pos].rson
#define mid (l+r>>1)
struct Tree_of_Tree{
	int Rt;
	int n1,n2;
	vector<long long> X,Y;
	void init()
	{
		sort(X.begin(),X.end());X.erase(unique(X.begin(),X.end()),X.end());
		sort(Y.begin(),Y.end());Y.erase(unique(Y.begin(),Y.end()),Y.end());
		n1=X.size()-1,n2=Y.size()-1;
	}
	void change_node(int &pos,int x,int num,int l,int r)
	{
		if(!pos) pos=++poi_cnt,s[pos].mx=num;
		s[pos].mx=max(s[pos].mx,num);
		if(l==r) return;
		if(x<=mid) change_node(ls,x,num,l,mid);
		else change_node(rs,x,num,mid+1,r); 
	}
	void Change_node(int &pos,int X,int Y,int num,int l,int r)
	{
		if(!pos) pos=++poi_cnt;
		change_node(s[pos].mx,Y,num,0,n2);
		if(l==r) return;
		if(X<=mid) Change_node(ls,X,Y,num,l,mid);
		else Change_node(rs,X,Y,num,mid+1,r);
	}
	int prefix_max(int pos,int x,int l,int r)
	{
		if(x<l||!pos) return -20070610;
		if(r<=x) return s[pos].mx;
		if(x<=mid) return prefix_max(ls,x,l,mid);
		else return max((ls?s[ls].mx:-20070610),prefix_max(rs,x,mid+1,r));
	}
	int Prefix_max(int pos,int X,int Y,int l,int r)
	{
		if(X<l||!pos) return -20070610;
		if(r<=X) return prefix_max(s[pos].mx,Y,0,n2);
		if(X<=mid) return Prefix_max(ls,X,Y,l,mid);
		else return max(prefix_max(s[ls].mx,Y,0,n2),Prefix_max(rs,X,Y,mid+1,r));
	}
}S[200010];
#undef ls
#undef rs
#undef mid
int n,r,b,k,tk,xx,yy;char op;
int R[200010],B[200010];
int f[200010];
int main()
{
	n=Qread(),r=Qread(),b=Qread();k=r+b;
	
	S[0].X.push_back(0),S[0].Y.push_back(0);
	
	for(int i=1;i<=n;i++)
	{
		op=get_ch();
		R[i]=R[i-1],B[i]=B[i-1];
		if(op=='R') R[i]++;
		if(op=='B') B[i]++;
	
		tk=i%k;
		S[tk].X.push_back(1ll*r*i-1ll*k*R[i]);
		S[tk].Y.push_back(1ll*b*i-1ll*k*B[i]);
	}
	for(int i=0;i<k;i++) S[i].init();
	
	xx=lower_bound(S[0].X.begin(),S[0].X.end(),0)-S[0].X.begin();
	yy=lower_bound(S[0].Y.begin(),S[0].Y.end(),0)-S[0].Y.begin();
	S[0].Change_node(S[0].Rt,xx,yy,0,0,S[0].n1);
	
//	printf("%d %d\n",xx,yy);
	
	for(int i=1;i<=n;i++)
	{
		tk=i%k;
		xx=lower_bound(S[tk].X.begin(),S[tk].X.end(),1ll*r*i-1ll*k*R[i])-S[tk].X.begin();
		yy=lower_bound(S[tk].Y.begin(),S[tk].Y.end(),1ll*b*i-1ll*k*B[i])-S[tk].Y.begin();
		
//		printf("%d[%d]:%lld(%d) %lld(%d)\n",i,tk,1ll*r*i-1ll*k*R[i],xx,1ll*b*i-1ll*k*B[i],yy);
		
		f[i]=max(f[i-1],i+S[tk].Prefix_max(S[tk].Rt,xx,yy,0,S[tk].n1));
		
//		printf("%d\n",f[i]);
		
		S[tk].Change_node(S[tk].Rt,xx,yy,f[i]-i,0,S[tk].n1);
	}
	printf("%d\n",f[n]/k);
	return 0;
}