#include "bits/stdc++.h"
#ifdef DEBUG
#include "PrettyDebug.hpp"
#else
#define debug(...) [](){}()
#define debuga(...) [](){}()
#endif
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
using namespace std; typedef long long ll;
constexpr int N=4e5+5,M=1e7+5;
int n,R,B,a[N],b[N],LL[N],RR[N],rt[N],lc[M],rc[M],tot,pos[N],vis[M],val[M]; char s[N]; int f[N]; vector<int> lis[N];
int insert(int k,int l,int r,int x,int o){
    int p=++tot; if(l==r) return pos[o]=p,p;
    int mid=(l+r)>>1;
    if(x<=mid) lc[p]=insert(lc[k],l,mid,x,o),rc[p]=rc[k];
    else rc[p]=insert(rc[k],mid+1,r,x,o),lc[p]=lc[k];
    return p;
}
void query(int k,int l,int r,int ql,int qr,vector<int>& vec){
    if(k==0) return;
    if(ql<=l&&r<=qr) return vec.push_back(k),void();
    int mid=(l+r)>>1;
    if(ql<=mid) query(lc[k],l,mid,ql,qr,vec);
    if(mid+1<=qr) query(rc[k],mid+1,r,ql,qr,vec);
}
int calc(int k){
    if(!k) return 1e9;
    if(vis[k]) return val[k];
    vis[k]=1; return val[k]=min(calc(lc[k]),calc(rc[k]));
}
signed main(){
    atexit([](){cerr<<"Time = "<<clock()<<" ms"<<endl;});
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n>>R>>B>>(s+1); For(i,1,n) f[i]=1e9;
    For(i,1,n) a[i]=a[i-1]+(s[i]=='R'||s[i]=='W');
    For(i,1,n) b[i]=b[i-1]+(s[i]=='R');
    LL[0]=RR[0]=n;
    For(i,1,n) RR[i]=a[i]-R*(i/(R+B))+n;
    For(i,1,n) LL[i]=b[i]-R*(i/(R+B))+n;
    For(i,0,n) debug(i,LL[i],RR[i]);
    For(qwq,0,R+B-1){
        static int tmp[N]; int tcnt=0;
        for(int i=qwq;i<=n;i+=(R+B)) tmp[++tcnt]=i;
        sort(tmp+1,tmp+1+tcnt,[&](int x,int y){return RR[x]!=RR[y]?RR[x]<RR[y]:LL[x]!=LL[y]?LL[x]>LL[y]:x<y;});
        debuga(tmp,1,tcnt);
        For(i,1,tcnt){
            int u=tmp[i];
            if(i!=1) query(rt[tmp[i-1]],0,n*2,LL[u],RR[u],lis[u]);
            rt[u]=insert(i==1?0:rt[tmp[i-1]],0,n*2,LL[u],u);
        }
    }
    For(i,0,n) assert(pos[i]);
    For(i,0,n){
        if(i){
            f[i]=f[i-1]+1;
            for(int k:lis[i]) f[i]=min(f[i],calc(k));
        }
        vis[pos[i]]=1; val[pos[i]]=f[i];
    }
    // For(i,1,n){
    //     f[i]=f[i-1]+1;
    //     for(int j=i-(R+B);j>=0;j-=(R+B)) if(LL[i]<=LL[j]&&RR[j]<=RR[i]) f[i]=min(f[i],f[j]);
    // }
    debuga(f,0,n);
    cout<<(n-f[n])/(R+B)<<'\n';
    return 0;
}

// CONTINUE, NON-STOPPING, FOR CHARLIEY
// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING

// Started Coding On: May 24 Fri, 08 : 24 : 00