#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+10;
ll B[N],R[N],b1[N],r1[N];
char a[N];
struct node{
    int x,y,i;
}d[N];
int tr,tb,dp[N];
int t[N];
void add(int x,int val){
    x=tr-x+1;
    for(;x<=tr;x+=x&-x)t[x]=max(t[x],val);
}
int q(int x){
    x=tr-x+1;
    int ans=-1e9;
    for(;x;x-=x&-x)ans=max(ans,t[x]);
    return ans;
}
void cl(int x){
    x=tr-x+1;
    for(;x<=tr;x+=x&-x)t[x]=-1e9;
}
int id[N];
int cmp(int x,int y){
    if(d[x].x!=d[y].x)return d[x].x>d[y].x;
    return d[x].i<d[y].i;
}
int r,b;
void sol(int L,int R){
    if(L==R)return;
    int mid=L+R>>1;
    sol(L,mid);
    for(int o=0;o<r+b&&L+o<=mid;o++){
        int tot=0;
        for(int i=L+o;i<=R;i+=r+b)id[++tot]=i;
        sort(id+1,id+1+tot,cmp);
        
        for(int i=1;i<=tot;i++){
            int x=id[i];
            // if(o==0&&l==0&&r==4)cout<<x<<" ";
            if(x<=mid)add(d[x].y,dp[x]-x);
            else dp[x]=max(dp[x],q(d[x].y)+x);
        }
        for(int i=1;i<=tot;i++)if(id[i]<=mid)cl(d[id[i]].y);
    }
    for(int i=mid+1;i<=R;i++)dp[i]=max(dp[i],dp[i-1]);
    sol(mid+1,R);
}
int main() {
    memset(t,-0x3f,sizeof(t));
    int n;
    scanf("%d%d%d%s",&n,&r,&b,a+1);
    for(int i=1;i<=n;i++){
        R[i]=R[i-1]+(a[i]=='R');
        B[i]=B[i-1]+(a[i]=='B');
        b1[i]=B[i]*(r+b)-(ll)i*b;
        r1[i]=R[i]*(r+b)-(ll)i*r;
    }
    b1[n+1]=0,r1[n+1]=0;
    sort(b1+1,b1+n+2);tb=unique(b1+1,b1+2+n)-b1-1;
    sort(r1+1,r1+n+2);tr=unique(r1+1,r1+2+n)-r1-1;
    for(int i=0;i<=n;i++){
        R[i]=lower_bound(r1+1,r1+1+tr,R[i]*(r+b)-(ll)i*r)-r1;
        B[i]=lower_bound(b1+1,b1+1+tb,B[i]*(r+b)-(ll)i*b)-b1;
        // cout<<B[i]<<" "<<R[i]<<"\n";
        d[i]={B[i],R[i],i};
    }
    sol(0,n);
    printf("%d\n",dp[n]/(r+b));
    return 0;
}