#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
int read() {
    int x=0; char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48, ch=getchar();
    return x;
}

const int N=2e5+3, inf=1e9;
int n, r, b, bl, br, rl, rr, R[N], B[N], rt[N], f[N];
char s[N];

#define mid (l+r>>1)
struct node {
    int l, r, o;
};
struct seg1 {
    node t[N*400];
    int tot;

    void add(int &p, int l, int r, int x, int w) {
        if (!p) t[p=++tot].o=-inf;
        t[p].o=max(w, t[p].o);
        if (l==r) return;
        if (x<=mid) add(t[p].l, l, mid, x, w);
        else add(t[p].r, mid+1, r, x, w);
    }
    int ask(int p, int l, int r, int x) {
        if (!p||r<x) return -inf;
        if (l>=x) return t[p].o;
        return max(ask(t[p].l, l, mid, x), ask(t[p].r, mid+1, r, x));
    }
} t1;
struct seg2 {
    node t[N*20];
    int tot;

    void add(int &p, int l, int r, int x, int y, int w) {
        if (!p) p=++tot;
        t1.add(t[p].o, bl, br, y, w);
        if (l==r) return;
        if (x<=mid) add(t[p].l, l, mid, x, y, w);
        else add(t[p].r, mid+1, r, x, y, w);
    }
    int ask(int p, int l, int r, int x, int y) {
        if (!p||r<x) return -inf;
        if (l>=x) return t1.ask(t[p].o, bl, br, y);
        return max(ask(t[p].l, l, mid, x, y),
                    ask(t[p].r, mid+1, r, x, y));
    }
} t2;

int main() {
    n=read(), r=read(), b=read();
    scanf("%s", s+1);
    for (int i=1; i<=n; i++) 
        B[i]=B[i-1]+(s[i]=='B'), R[i]=R[i-1]+(s[i]=='R');
    for (int i=1; i<=n; i++) {
        B[i]-=i/(r+b)*b, R[i]-=i/(r+b)*r;
        bl=min(bl, B[i]), br=max(br, B[i]);
        rl=min(rl, R[i]), rr=max(rr, R[i]);
    }
    t2.add(rt[0], rl, rr, 0, 0, 0);
    for (int i=1; i<=n; i++) {
        f[i]=max(f[i-1], i/(r+b)+t2.ask(rt[i%(r+b)], rl, rr, R[i], B[i]));
        t2.add(rt[i%(r+b)], rl, rr, R[i], B[i], f[i]-i/(r+b));
    }
    cout<<f[n]<<'\n';
    return 0;
}