Educational Codeforces Round 119 (Rated for Div. 2) C. BA-String

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long 
const int mod=998244353; 
const int N=2e5+10;
int t,n,k,x;
char ch[N];
void dfs(int pos,int now){
	if(pos==0) return ;
	int cnt=0;
	while(pos&&ch[pos--]=='*') ++cnt;
	// cout<<pos<<endl;
	dfs(pos,now/(cnt*k+1));
	if(ch[pos+1]=='a') cout<<'a';
	for(int i=1;i<=now%(cnt*k+1);i++) cout<<'b';
}
int32_t main(){
	scanf("%lld",&t);
	while(t--){
		scanf("%lld%lld%lld",&n,&k,&x);cin>>ch+1;
		dfs(n,x-1);cout<<endl;
	}
}