#include #pragma GCC optimize("Ofast") using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=2167167167167167167; const int INF=2100000000; const ll mod=998244353; #define rep(i,a) for (int i=0;i using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";} template void vec_out(vector &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout< T min(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template T max(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} namespace po167{ template struct segment_tree{ int _n,size; std::vector seg; int ceil_pow2(int a){ int b=1; while(a>b){ b<<=1; } return b; } void update(int k){seg[k]=op(seg[k*2],seg[k*2+1]);}; segment_tree(int n) :_n(n){ size=ceil_pow2(n); seg=std::vector(size*2,e()); } segment_tree(std::vector &p) :_n((int) p.size()){ size=ceil_pow2(_n); seg=std::vector(size*2,e()); for(int i=0;i<_n;i++) seg[i+size]=p[i]; for(int i=size-1;i>0;i--) update(i); } void set(int ind,T val){ assert(0<=ind&&ind<_n); ind+=size; seg[ind]=val; while(ind!=1){ ind>>=1; update(ind); } } void addl(int ind,T val){ set(ind,op(get(ind),val)); } void addr(int ind,T val){ set(ind,op(val,get(ind))); } T get(int ind){ assert(0<=ind&&ind<_n); return seg[ind+size]; } T query(int l,int r){ assert(0<=l&&l<=r&&r<=_n); T l_val=e(); T r_val=e(); l+=size,r+=size; while(l>=1; l>>=1; } return op(l_val,r_val); } template int max_right(int l) { return max_right(l, [](T x) { return f(x); }); } template int max_right(int l, F f) { assert(0<=l&&l<=_n); assert(f(e())); if(f(query(l,_n))) return _n; T val=e(); l+=size; while(true){ while(l%2==0) l>>=1; if(!f(op(val,seg[l]))){ while(l int min_left(int r) { return min_left(r, [](T x) { return f(x); }); } template int min_left(int r, F f) { assert(0 <= r && r <= _n); assert(f(e())); if (r == 0) return 0; r += size; T sm = e(); do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!f(op(seg[r], sm))) { while (r < size) { r = (2 * r + 1); if (f(op(seg[r], sm))) { sm = op(seg[r], sm); r--; } } return r + 1 - size; } sm = op(seg[r], sm); } while ((r & -r) != r); return 0; } }; } using po167::segment_tree; using F= int; F op(F a,F b){return a+b;} F e(){return 0;} int target; bool f(F x){ return (x>t; rep(i,t) solve(); } void solve(){ int N,A,B; cin>>N>>A>>B; string S; cin>>S; int J=0; if(A p(N),q(N); if(B>=2){ int l=1+(N-A)*2,r=N*2; for(int i=A;i seg(N); rep(i,N){ if(S[i]=='a') seg.set(i,1); } vector L,R; int l=1,r=2*N; rep(i,N){ if(S[i]=='a') p[i]=r,r--; } for(int i=N-1;i>=0;i--){ if(S[i]=='b') p[i]=l,l++; } rep(i,N) q[i]=r-i; //vec_out(p); //vec_out(q); rep(i,N+1){ if(i==0&&seg.query(i,N)>=A){ for(int j=i;(int)(L.size())+(int)(R.size())!=A;j++){ if(S[j]=='a') R.push_back(j); } break; } if((int)L.size()==A-1){ if(seg.query(i,N)) break; } if((int)L.size()+seg.query(i,N)>=A&&!L.empty()){ for(int j=i;(int)(L.size())+(int)(R.size())!=A;j++){ if(S[j]=='a') R.push_back(j); } break; } if(i==N){ cout<<"No\n"; return; } if(S[i]=='b'){ L.push_back(i); } } int s=0,t=L.size(); t--; while(s