#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
char str[MAXN]; int pre[2][MAXN], n;
int rmin, rmax, bmin, bmax;
namespace sgt {
	int val[MAXN * 380], ls[MAXN * 380], rs[MAXN * 380], tot;
	void modify(int &rt, int l, int r, int x, int w) {
		if (rt == 0) val[rt = ++tot] = -0x3f3f3f3f; val[rt] = max(val[rt], w); if (l == r) return;
		int mid = (l + r) >> 1; x <= mid ? modify(ls[rt], l, mid, x, w) : modify(rs[rt], mid + 1, r, x, w);
	}
	void modify(int &rt, int l, int r, int x1, int x2, int w) {
		if (rt == 0) rt = ++tot; modify(val[rt], bmin, bmax, x2, w); if (l == r) return;
		int mid = (l + r) >> 1; x1 <= mid ? modify(ls[rt], l, mid, x1, x2, w) : modify(rs[rt], mid + 1, r, x1, x2, w);
	}
	int query(int rt, int l, int r, int x) {
		if (rt == 0) return -0x3f3f3f3f; if (r <= x) return val[rt]; int mid = (l + r) >> 1;
		return max(query(ls[rt], l, mid, x), x > mid ? query(rs[rt], mid + 1, r, x) : -0x3f3f3f3f);
	}
	int query(int rt, int l, int r, int x1, int x2) {
		if (rt == 0) return -0x3f3f3f3f; if (r <= x1) return query(val[rt], bmin, bmax, x2); int mid = (l + r) >> 1;
		return max(query(ls[rt], l, mid, x1, x2), x1 > mid ? query(rs[rt], mid + 1, r, x1, x2) : -0x3f3f3f3f);
	}
}
int rt[MAXN];
int main() {
	int r, b; scanf("%d %d %d", &n, &r, &b); scanf("%s", str + 1);
	for (int i = 1; i <= n; i++) pre[0][i] = pre[0][i - 1] + (str[i] == 'R'), pre[1][i] = pre[1][i - 1] + (str[i] == 'B');
	rmin = bmin = 0x3f3f3f3f; rmax = bmax = -0x3f3f3f3f;
	for (int i = 0; i <= n; i++) {
		rmin = min(rmin, i / (r + b) * r - pre[0][i]);
		rmax = max(rmax, i / (r + b) * r - pre[0][i]);
		bmin = min(bmin, i / (r + b) * b - pre[1][i]);
		bmax = max(bmax, i / (r + b) * b - pre[1][i]);
	}
	int ans = 0;
	for (int i = 0; i <= n; i++) {
		ans = max(i / (r + b) + sgt::query(rt[i % (r + b)], rmin, rmax, i / (r + b) * r - pre[0][i], i / (r + b) * b - pre[1][i]), ans);
		sgt::modify(rt[i % (r + b)], rmin, rmax, i / (r + b) * r - pre[0][i], i / (r + b) * b - pre[1][i], ans - i / (r + b));
	}
	printf("%d\n", ans);
}