#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

bool Mst;

const int maxn = 200100;
const int inf = 0x3f3f3f3f;

ll n, A, B, a[maxn], b[maxn], lsh1[maxn], tot1, lsh2[maxn], tot2, c[maxn], d[maxn];
int id[maxn * 20], rt[maxn], ls1[maxn * 20], rs1[maxn * 20];
int ls2[maxn * 350], rs2[maxn * 350], mx[maxn * 350], nt1, nt2, f[maxn];
char s[maxn];

void update2(int &rt, int l, int r, int x, int y) {
	if (!rt) {
		rt = ++nt2;
		mx[rt] = -inf;
	}
	mx[rt] = max(mx[rt], y);
	if (l == r) {
		return;
	}
	int mid = (l + r) >> 1;
	(x <= mid) ? update2(ls2[rt], l, mid, x, y) : update2(rs2[rt], mid + 1, r, x, y);
}

int query2(int rt, int l, int r, int ql, int qr) {
	if (!rt || ql > qr) {
		return -inf;
	}
	if (ql <= l && r <= qr) {
		return mx[rt];
	}
	int mid = (l + r) >> 1, res = -inf;
	if (ql <= mid) {
		res = max(res, query2(ls2[rt], l, mid, ql, qr));
	}
	if (qr > mid) {
		res = max(res, query2(rs2[rt], mid + 1, r, ql, qr));
	}
	return res;
}

void update1(int &rt, int l, int r, int x, int y, int z) {
	if (!rt) {
		rt = ++nt1;
	}
	update2(id[rt], 1, tot2, y, z);
	if (l == r) {
		return;
	}
	int mid = (l + r) >> 1;
	(x <= mid) ? update1(ls1[rt], l, mid, x, y, z) : update1(rs1[rt], mid + 1, r, x, y, z);
}

int query1(int rt, int l, int r, int qlx, int qrx, int qly, int qry) {
	if (!rt || qlx > qrx || qly > qry) {
		return -inf;
	}
	if (qlx <= l && r <= qrx) {
		return query2(id[rt], 1, tot2, qly, qry);
	}
	int mid = (l + r) >> 1, res = -inf;
	if (qlx <= mid) {
		res = max(res, query1(ls1[rt], l, mid, qlx, qrx, qly, qry));
	}
	if (qrx > mid) {
		res = max(res, query1(rs1[rt], mid + 1, r, qlx, qrx, qly, qry));
	}
	return res;
}

void solve() {
	scanf("%lld%lld%lld%s", &n, &A, &B, s + 1);
	for (int i = 1; i <= n; ++i) {
		a[i] = a[i - 1] + (s[i] == 'R');
		b[i] = b[i - 1] + (s[i] == 'B');
	}
	for (int i = 0; i <= n; ++i) {
		lsh1[++tot1] = A * i - (A + B) * a[i];
		lsh2[++tot2] = B * i - (A + B) * b[i];
	}
	sort(lsh1 + 1, lsh1 + tot1 + 1);
	sort(lsh2 + 1, lsh2 + tot2 + 1);
	tot1 = unique(lsh1 + 1, lsh1 + tot1 + 1) - lsh1 - 1;
	tot2 = unique(lsh2 + 1, lsh2 + tot2 + 1) - lsh2 - 1;
	for (int i = 0; i <= n; ++i) {
		c[i] = lower_bound(lsh1 + 1, lsh1 + tot1 + 1, A * i - (A + B) * a[i]) - lsh1;
		d[i] = lower_bound(lsh2 + 1, lsh2 + tot2 + 1, B * i - (A + B) * b[i]) - lsh2;
	}
	update1(rt[0], 1, tot1, c[0], d[0], 0);
	for (int i = 1; i <= n; ++i) {
		f[i] = max(f[i - 1], query1(rt[i % (A + B)], 1, tot1, 1, c[i], 1, d[i]) + i);
		update1(rt[i % (A + B)], 1, tot1, c[i], d[i], f[i] - i);
	}
	printf("%lld\n", f[n] / (A + B));
}

bool Med;

int main() {
	fprintf(stderr, "%.2lf MB\n", (&Mst - &Med) / 1048576.);
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}