#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int N = 1e6+5,inf = 1e9;
int n,r,b,l,idx,lim_r,lim_b,R[N],B[N];
ll kr[N],kb[N];
int ls[N*80],rs[N*80],val[N*80],y[N],f[N];
int qry(int l,int r,int u,int kb){
	if(!u) return -inf;
	if(kb<=l) return val[u];
	int mid = (l+r)>>1,res = -inf;
	if(kb<=mid) res = max(res,qry(l,mid,ls[u],kb));
	res = max(res,qry(mid+1,r,rs[u],kb));
	return res;
}
int ask(int l,int r,int u,int kr,int kb){
	if(!u) return -inf;
	if(kr<=l) return qry(1,lim_b,val[u],kb);
	int mid = (l+r)>>1,res = -inf;
	if(kr<=mid) res = max(res,ask(l,mid,ls[u],kr,kb));
	res = max(res,ask(mid+1,r,rs[u],kr,kb));
	return res;  
} 
void add(int l,int r,int &u,int kb,int v){
	if(!u) u = ++idx,val[u] = -inf;
	if(l==r){
		val[u] = max(val[u],v);
		return ;
	} 
	int mid = (l+r)>>1;
	if(kb<=mid) add(l,mid,ls[u],kb,v);
	else add(mid+1,r,rs[u],kb,v);
	val[u] = max(val[ls[u]],val[rs[u]]);
}
void update(int l,int r,int &u,int kr,int kb,int v){
	if(!u) u = ++idx,val[u] = 0;
	add(1,lim_b,val[u],kb,v);
	if(l==r) return ;
	int mid = (l+r)>>1;
	if(kr<=mid) update(l,mid,ls[u],kr,kb,v);
	else update(mid+1,r,rs[u],kr,kb,v);
}
int main(){
	cin.tie(0),cout.tie(0);
	ios::sync_with_stdio(0);
	cin >> n >> r >> b;
	l = r+b;
	for(int i=1;i<=n;i++){
		char ch;cin >> ch;
		R[i] = R[i-1],B[i] = B[i-1];
		if(ch=='R') R[i]++;
		if(ch=='B') B[i]++;
		kr[i] = 1ll*l*R[i]-1ll*r*i;
		kb[i] = 1ll*l*B[i]-1ll*b*i; 
	}
	vector<ll> vec;
	for(int i=0;i<=n;i++) vec.pb(kr[i]);
	sort(vec.begin(),vec.end()),vec.erase(unique(vec.begin(),vec.end()),vec.end());
	for(int i=0;i<=n;i++) kr[i] = lower_bound(vec.begin(),vec.end(),kr[i])-vec.begin()+1;
	lim_r = vec.size(),vec.clear();
	for(int i=0;i<=n;i++) vec.pb(kb[i]);
	sort(vec.begin(),vec.end()),vec.erase(unique(vec.begin(),vec.end()),vec.end());
	for(int i=0;i<=n;i++) kb[i] = lower_bound(vec.begin(),vec.end(),kb[i])-vec.begin()+1;
	lim_b = vec.size(),vec.clear();	
	val[0] = -inf,update(1,lim_r,y[0],kr[0],kb[0],0);
	for(int i=1;i<=n;i++){
		f[i] = f[i-1];
		f[i] = max(f[i],ask(1,lim_r,y[i%l],kr[i],kb[i])+i);
		update(1,lim_r,y[i%l],kr[i],kb[i],f[i]-i);
	}
	cout << f[n]/l;
	return 0;
}
/*
4 1 1
BBWR

6 2 1
RBBBWB

13 3 3
WWWWWWWWWWWWW
*/