#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef unsigned int uint;
inline ll read() {
	ll x=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch)) {x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
	return x*f;
}
const ll N=2e5+5;
int n,r,b,upR,upB,preR[N],preB[N],ex[N];
ll R[N],B[N];
char s[N];
map <ll,int> mp;
int lsh(ll *a) {
    int cnt=0;mp.clear();
    vector <ll> vec;
    for(int i=0;i<=n;i++) vec.push_back(a[i]);
    sort(vec.begin(),vec.end());
    vec.resize(unique(vec.begin(),vec.end())-vec.begin());
    for(ll nw:vec) mp[nw]=++cnt;
    for(int i=0;i<=n;i++) a[i]=mp[a[i]];
    return cnt;
}
struct BIT {
    #define mid ((l+r)>>1)
    struct Node {
        #define lc(t) nd[t].lc
        #define rc(t) nd[t].rc
        #define mx(t) nd[t].mx
        int lc,rc,mx;
    }nd[N*400];
    int tot,rt[N*25];
    int add() {
        return ++tot;
    }
    void pushup(int t) {
        mx(t)=max(mx(lc(t)),mx(rc(t)));
    }
    void Upd(int t,int l,int r,int p,int k) {
        if(l==r) return mx(t)=max(mx(t),k),void();
        if(p<=mid) {
            if(!lc(t)) lc(t)=add();
            Upd(lc(t),l,mid,p,k);
        }
        else {
            if(!rc(t)) rc(t)=add();
            Upd(rc(t),mid+1,r,p,k);
        }
        pushup(t);
    }
    void upd(int id,int p,int k) {
        if(!rt[id]) rt[id]=add();
        Upd(rt[id],1,upB,p,k);
    }
    int mx;
    void Query(int t,int l,int r,int ll,int rr) {
        if(!t) return ;
        if(ll<=l&&r<=rr) return mx=max(mx,mx(t)),void();
        if(ll<=mid) Query(lc(t),l,mid,ll,rr);
        if(rr>=mid+1) Query(rc(t),mid+1,r,ll,rr);
    }
    int query(int id,int l,int r) {
        mx=0;Query(rt[id],1,upB,l,r);
        return mx;
    }
    #undef mid
}bit;
struct SGT {
    #define mid ((l+r)>>1)
    struct Node {
        #define rt(t) nd[t].rt
        #define ls(t) nd[t].ls
        #define rs(t) nd[t].rs
        int rt,ls,rs;
    }nd[N*25];
    int tot,rt[N];
    int add() {
        return ++tot;
    }
    void Upd(int t,int l,int r,int px,int py,int k) {
        bit.upd(t,py,k);
        if(l==r) return ;
        if(px<=mid) {
            if(!ls(t)) ls(t)=add();
            Upd(ls(t),l,mid,px,py,k);
        }
        else {
            if(!rs(t)) rs(t)=add();
            Upd(rs(t),mid+1,r,px,py,k);
        }
    }
    void upd(int tp,int px,int py,int k) {
        if(!rt[tp]) rt[tp]=add();
        Upd(rt[tp],1,upR,px,py,k);
    }
    int mx;
    void Query(int t,int l,int r,int xl,int xr,int yl,int yr) {
        if(!t) return ;
        if(xl<=l&&r<=xr) return mx=max(mx,bit.query(t,yl,yr)),void();
        if(xl<=mid) Query(ls(t),l,mid,xl,xr,yl,yr);
        if(xr>=mid+1) Query(rs(t),mid+1,r,xl,xr,yl,yr);
    }
    int query(int tp,int xr,int yr) {
        mx=0;Query(rt[tp],1,upR,1,xr,1,yr);
        return mx;
    }
    #undef mid
}sgt;
int f[N];
int main() {
//    cerr<<1.0*sizeof(bit)/1024.0/1024.0<<'\n';
//    freopen("data.in","r",stdin);
//    freopen(".out","w",stdout);
    n=read(),r=read(),b=read();
    for(int i=1;i<=n;i++) {
        cin>>s[i];
        preR[i]=preR[i-1]+(s[i]=='R');
        preB[i]=preB[i-1]+(s[i]=='B');
    }
    for(int i=0;i<=n;i++) {
        R[i]=1ll*i*r-1ll*(r+b)*preR[i];
        B[i]=1ll*i*b-1ll*(r+b)*preB[i];
    }
    for(int i=0;i<=n;i++) ex[i%(r+b)]=i;
    upR=lsh(R),upB=lsh(B);
    int ans=0;
    for(int i=0;i<=n;i++) {
        int tp=i%(r+b);
        if(i<r+b) {
            sgt.upd(tp,R[i],B[i],f[i]+(ex[tp]-i)/(r+b));
            continue;
        }
        f[i]=f[i-1];
        f[i]=max(f[i],sgt.query(tp,R[i],B[i])-(ex[tp]-i)/(r+b));
        sgt.upd(tp,R[i],B[i],f[i]+(ex[tp]-i)/(r+b));
        ans=max(ans,f[i]);
    }
    cout<<ans<<'\n';
	return 0;
}