#include #define show(x) cout << #x << " = " << x << endl using namespace std; using ll = long long; using pii = pair; using vi = vector; template ostream& operator<<(ostream& os, const vector& v) { os << "sz=" << v.size() << "\n["; for (const auto& p : v) { os << p << ","; } os << "]\n"; return os; } template ostream& operator<<(ostream& os, const pair& p) { os << "(" << p.first << "," << p.second << ")"; return os; } constexpr ll MOD = 1e9 + 7; template constexpr T INF = numeric_limits::max() / 100; constexpr int MAXIMUM = 1 << 10; int main() { int kr, kb; cin >> kr >> kb; string s; cin >> s; vector reds; vector blues; for (ll i = 0; i < 30; i++) { if (s[i] == 'R') { reds.push_back(i); } else if (s[i] == 'B') { blues.push_back(i); } } int mini = 100; for (int i = 0; i <= MAXIMUM; i++) { for (int j = 0; j <= MAXIMUM; j++) { bool ok[30]; fill(ok, ok + 30, true); int numi = i; int popi = 0; int indi = 0; while (numi > 0) { if (numi % 2 == 1) { popi++; ok[reds[indi]] = false; } indi++; numi /= 2; } int numj = j; int popj = 0; int indj = 0; while (numj > 0) { if (numj % 2 == 1) { popj++; ok[blues[indj]] = false; } indj++; numj /= 2; } string str; for (ll p = 0; p < 30; p++) { if (ok[p]) { str.push_back(s[p]); } } bool flag = true; for (int p = 0; p < str.size(); p++) { if (str[p] == 'R') { if (p >= kr and str[p - kr] == 'R') { flag = false; break; } } else if (str[p] == 'B') { if (p >= kb and str[p - kb] == 'B') { flag = false; break; } } } if (flag) { mini = min(mini, popi + popj); } } } cout << 30 - mini << endl; return 0; }