#include <bits/stdc++.h>
#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<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &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<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T max(vector<T> &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<B){
		swap(A,B);
		rep(i,N){
			if(S[i]=='a') S[i]='b';
			else S[i]='a';
		}
		J=1;
	}
	vector<int> p(N),q(N);
	vector<int> 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<<A<<" "<<B<<endl;
	}
	int ind=1;
	reverse(all(Y));
	for(auto x:X) Y.push_back(x);
	for(auto x:Y){
		if(x<N) p[x]=ind;
		else q[x-N]=ind;
		ind++;
	}
	if(J){
		swap(p,q);
	}
	if(A+B!=0){
		cout<<"No\n";
	}else{
		cout<<"Yes\n";
		vec_out(p);
		vec_out(q);
	}
}