#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;} void solve(); // oddloop int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t=1; cin>>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); vector X={0,N},Y; p[0]=1,q[0]=1; if(S[0]=='a') X={N,0}; A--,B--; rep(i,N){ if(i==0) continue; if(S[i]=='a'){ if(A==0){ Y.push_back(i); Y.push_back(i+N); } else if(A==B){ A--; B--; X.push_back(i+N); X.push_back(i); }else{ A--; X.push_back(i); Y.push_back(i+N); } }else{ if(B){ A--,B--; X.push_back(i); X.push_back(i+N); }else{ Y.push_back(i+N); Y.push_back(i); } } //cout<