#include <bits/stdc++.h>
#define inf 1000000007
#define mod 1000000007
// #define int long long
// #pragma GCC optimize("Ofast","inline","-ffast-math")
// #pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n,m;
long long k;
char d[15];
__int128_t ans;
int pre[35],suf[35];
long long get(long long x,long long y)
{
	int a=x/(1<<n),b=x%(1<<n),c=y/(1<<m),d=y%(1<<m);
	return (a^d)+(1ll<<m)*(b^c);
}
long long calc(int y,int x)
{
	if(x<0) return 0;
	for(int i=29;i>=0;--i)
		pre[i]=pre[i+1]*2+(x>>(i+1)&1);
	for(int i=1;i<=29;++i)
		suf[i]=suf[i-1]+((x>>(i-1)&1)<<(i-1));
	long long res=0;
	for(int i=29;i>=0;--i)
	{
		int cnt0=(x>>i&1?(pre[i]+1)*(1<<i):pre[i]*(1<<i)+suf[i]+1);
		res+=1ll*cnt0*((y>>i&1)<<i);
		int cnt1=(x>>i&1?pre[i]*(1<<i)+suf[i]+1:pre[i]*(1<<i));
		res+=1ll*cnt1*((y>>i&1^1)<<i);
	}
	return res;
}
signed main()
{
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	int tc;read(tc);
	while(tc--)
	{
		read(n);read(m);scanf("%s",d);read(k);
		ans=0;
		if(d[0]=='l')
		{
			long long cnt=get(k-1,0)+1;
			int rnd=cnt/(1<<m),rem=cnt%(1<<m);
			ans+=(__int128_t)rnd*calc((k-1)/(1<<n),(1<<m)-1);
			if(rem) ans+=calc((k-1)/(1<<n),rem-1);
			__int128_t sum=0;
			if(rnd) sum+=(__int128_t)(1<<m)*calc((k-1)%(1<<n),rnd-1);
			sum+=(__int128_t)rem*(((k-1)%(1<<n))^rnd);
			ans+=sum*(1<<m);ans+=cnt;
			writeln(ans);
		}
		if(d[0]=='r')
		{
			long long cnt=get(k-1,(1ll<<n+m)-1)+1;
			int rnd=cnt/(1<<m),rem=cnt%(1<<m);
			ans+=(__int128_t)rnd*calc((k-1)/(1<<n),(1<<m)-1);
			ans+=calc((k-1)/(1<<n),(1<<m)-1)-calc((k-1)/(1<<n),(1<<m)-1-rem);
			__int128_t sum=0;
			if(rnd) sum+=(__int128_t)(1<<m)*(calc((k-1)%(1<<n),(1<<n)-1)-calc((k-1)%(1<<n),(1<<n)-1-rnd));
			sum+=(__int128_t)rem*(((k-1)%(1<<n))^((1<<n)-1-rnd));
			ans+=sum*(1<<m);ans+=cnt;
			writeln(ans);
		}
		if(d[0]=='t')
		{
			long long cnt=get(0,k-1)+1;
			int rnd=cnt/(1<<n),rem=cnt%(1<<n);
			__int128_t sum=0;
			sum+=(__int128_t)rnd*calc((k-1)/(1<<m),(1<<n)-1);
			if(rem) sum+=calc((k-1)/(1<<m),rem-1);
			ans+=sum*(1<<m);ans+=cnt;
			if(rnd) ans+=(__int128_t)(1<<n)*calc((k-1)%(1<<m),rnd-1);
			ans+=(__int128_t)rem*(((k-1)%(1<<m))^rnd);
			writeln(ans);
		}
		if(d[0]=='b')
		{
			long long cnt=get((1ll<<n+m)-1,k-1)+1;
			int rnd=cnt/(1<<n),rem=cnt%(1<<n);
			__int128_t sum=0;
			sum+=(__int128_t)rnd*calc((k-1)/(1<<m),(1<<n)-1);
			sum+=calc((k-1)/(1<<m),(1<<n)-1)-calc((k-1)/(1<<m),(1<<n)-1-rem);
			ans+=sum*(1<<m);ans+=cnt;
			if(rnd) ans+=(__int128_t)(1<<n)*(calc((k-1)%(1<<m),(1<<m)-1)-calc((k-1)%(1<<m),(1<<m)-1-rnd));
			ans+=(__int128_t)rem*(((k-1)%(1<<m))^((1<<m)-1-rnd));
			writeln(ans);
		}
	}
	return 0;
}