#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
#define N 1005
string s[N];
int n;
int _c[128];
int w[N][N];
void dfs(string cur)
{
	if(cur.length()==8)
	{
		int p1=-1,p2=-1,p=-1;
		for(int i=0;i<8;i++)
		{
			if(cur[i]=='R')
			{
				if(p1==-1) p1=i;
				else p2=i;
			}
			if(cur[i]=='K') p=i;
		}
		if(!(p1<p&&p<p2)) return ;
		p1=-1,p2=-1;
		for(int i=0;i<8;i++)
		{
			if(cur[i]=='B')
			{
				if(p1==-1) p1=i;
				else p2=i;
			}
		}
		if((p1&1)==(p2&1)) return ;
		s[n++]=cur;
	}
	if(_c['K']<1) _c['K']++,dfs(cur+"K"),_c['K']--;
	if(_c['Q']<1) _c['Q']++,dfs(cur+"Q"),_c['Q']--;
	if(_c['R']<2) _c['R']++,dfs(cur+"R"),_c['R']--;
	if(_c['B']<2) _c['B']++,dfs(cur+"B"),_c['B']--;
	if(_c['N']<2) _c['N']++,dfs(cur+"N"),_c['N']--;
}
#define M 500005
int q[M],ch[M][9],cnt,mxd,rt;
int solve(vector<int> v,int dep)
{
	int nw=++cnt; mxd=max(mxd,dep);
	if(v.size()==1) return -v[0];
	int mxx=inf,qry=-1;
	for(int i=0;i<n;i++)
	{
		vector<int> di[9];
		for(int j:v) di[w[i][j]].pb(j);
		int mx=0;
		for(int j=0;j<=8;j++) mx=max(mx,(int)di[j].size());
		if(mx<mxx) qry=i,mxx=mx;
	}
	q[nw]=qry;
	vector<int> di[9];
	for(int j:v) di[w[qry][j]].pb(j);
	for(int j=0;j<=8;j++) if(!di[j].empty()) ch[nw][j]=solve(di[j],dep+1);
	return nw;
}
void init()
{
	dfs("");
	for(int i=0;i<n;i++) for(int j=0;j<n;j++)
	{
		for(int k=0;k<8;k++) if(s[i][k]==s[j][k]) w[i][j]++;
		// printf("%d%c",w[i][j]," \n"[j==n-1]);
	}
	vector<int> v;
	for(int i=0;i<n;i++) v.pb(i);
	rt=solve(v,1);
	// cout<<mxd<<endl;
}
string ANS;
void qry(int u)
{
	if(u<=0) cout<<s[-u]<<endl;
	else cout<<s[q[u]]<<endl;
#ifdef wasa855
	string qr;
	if(u<=0) qr=s[-u];
	else qr=s[q[u]];
	int w=0;
	for(int i=0;i<8;i++) if(qr[i]==ANS[i]) w++;
#else
	int w=read();
#endif
	if(w==8) return ;
	qry(ch[u][w]);
}
void work()
{
	string s; cin>>s;
	if(s=="END") exit(0);
	read();
#ifdef wasa855
	cin>>ANS;
#endif
	qry(rt);
}
signed main()
{
	init();
	while(1) work();
	return 0;
}