#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; //constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pairP; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; template void chmin(T& a, T b) { a = min(a, b); } template void chmax(T& a, T b) { a = max(a, b); } template void cinarray(vector& v) { rep(i, v.size())cin >> v[i]; } template void coutarray(vector& v) { rep(i, v.size()) { if (i > 0)cout << " "; cout << v[i]; } cout << "\n"; } ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; //if (x == 0)return 0; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } //mod should be <2^31 struct modint { int n; modint() :n(0) { ; } modint(ll m) { if (m < 0 || mod <= m) { m %= mod; if (m < 0)m += mod; } n = m; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } bool operator<(modint a, modint b) { return a.n < b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 20; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } using ld = long double; //typedef long double ld; typedef pair LDP; const ld eps = 1e-10; const ld pi = acosl(-1.0); template void addv(vector& v, int loc, T val) { if (loc >= v.size())v.resize(loc + 1, 0); v[loc] += val; } /*const int mn = 2000005; bool isp[mn]; vector ps; void init() { fill(isp + 2, isp + mn, true); for (int i = 2; i < mn; i++) { if (!isp[i])continue; ps.push_back(i); for (int j = 2 * i; j < mn; j += i) { isp[j] = false; } } }*/ //[,val) template auto prev_itr(set& st, T val) { auto res = st.lower_bound(val); if (res == st.begin())return st.end(); res--; return res; } //[val,) template auto next_itr(set& st, T val) { auto res = st.lower_bound(val); return res; } using mP = pair; mP operator+(mP a, mP b) { return { a.first + b.first,a.second + b.second }; } mP operator+=(mP& a, mP b) { a = a + b; return a; } mP operator-(mP a, mP b) { return { a.first - b.first,a.second - b.second }; } mP operator-=(mP& a, mP b) { a = a - b; return a; } LP operator+(LP a, LP b) { return { a.first + b.first,a.second + b.second }; } LP operator+=(LP& a, LP b) { a = a + b; return a; } LP operator-(LP a, LP b) { return { a.first - b.first,a.second - b.second }; } LP operator-=(LP& a, LP b) { a = a - b; return a; } mt19937 mt(time(0)); const string drul = "DRUL"; string senw = "SENW"; //DRUL,or SENW //int dx[4] = { 1,0,-1,0 }; //int dy[4] = { 0,1,0,-1 }; //----------------------------------------- struct uf { private: vector par, ran; vector val; public: uf(int n) { par.resize(n, 0); ran.resize(n, 0); val.resize(n, 0); rep(i, n) { par[i] = i; } } int find(int x) { if (par[x] == x)return x; else return par[x] = find(par[x]); } void unite(int x, int y) { x = find(x), y = find(y); if (x == y) { val[x]++; return; } if (ran[x] < ran[y]) { par[x] = y; val[y] = max(val[x], val[y]) + 1; } else { par[y] = x; val[x] = max(val[x], val[y]) + 1; if (ran[x] == ran[y])ran[x]++; } } bool same(int x, int y) { return find(x) == find(y); } int ans() { return val[find(0)]; } }; void solve() { int n, a, b; cin >> n >> a >> b; string s; cin >> s; string con = "con"; auto isok = [&](int i) { if (i + 2 >= s.size())return false; rep(j, 3)if (s[i + j] != con[j])return false; return true; }; vector cs; rep(i, s.size()) { if (isok(i)) { int cnt = 1; while (isok(i + 3)) { i += 3; cnt++; } cs.push_back(cnt); } } vector dp = { 0 }; for (int c : cs) { int sup = c / a; vector ndp(dp.size() + sup, 0); rep(j, sup + 1) { int val = (c - a * j) / b; rep(i, dp.size()) { chmax(ndp[i + j], dp[i] + val); } } swap(dp, ndp); } int ans = 0; rep(i, dp.size()) { int c1 = i, c2 = dp[i]; chmax(ans, min(c1, c2) * 2); chmax(ans, min(c1 - 1, c2) * 2 + 1); } cout << ans << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); init_f(); //init(); //expr(); //while(true) //int t; cin >> t; rep(i, t) solve(); return 0; }