#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=60+5,M=1e7+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,k;char s[N*3],t[3][N];
ui ans;
int mx[N][3],p[3][N];
ui calc(vector<int> A,vector<int> B){
	Me(mx,0);
	for(int a:A) for(int b:B){
		int c=n-a-b;
		if(c<0||c>n) return 0;
		for(int i=1;i<=a;i++){
			mx[i+b][1]=max(mx[i+b][1],i);
			mx[i+b+c][2]=max(mx[i+b+c][2],i+b);
		}
		for(int i=1;i<=b;i++){
			mx[i+c][2]=max(mx[i+c][2],i);
			mx[i+a+c][0]=max(mx[i+a+c][0],i+c);
		}
		for(int i=1;i<=c;i++){
			mx[i+a][0]=max(mx[i+a][0],i);
			mx[i+a+b][1]=max(mx[i+a+b][1],i+a);
		}
	}
	for(int i=1;i<=n;i++) for(int o:{0,1,2}) mx[i][o]=max(mx[i][o],mx[i-1][o]);
	static ui dp[N][N][N];
	for(int a=0;a<=n;a++) for(int b=0;b<=n&&mx[b][1]<=a;b++) for(int c=mx[a][0];c<=n&&mx[c][2]<=b;c++) dp[a][b][c]=0;
	dp[0][0][0]=1;
	for(int a=0;a<=n;a++) for(int b=0;b<=n&&mx[b][1]<=a;b++) for(int c=mx[a][0];c<=n&&mx[c][2]<=b;c++){
		if(a^n&&s[a+b+c+1]^'B'&&s[a+b+c+1]^'C'&&c>=mx[a+1][0]) dp[a+1][b][c]+=dp[a][b][c];
		if(b^n&&s[a+b+c+1]^'A'&&s[a+b+c+1]^'C'&&a>=mx[b+1][1]) dp[a][b+1][c]+=dp[a][b][c];
		if(c^n&&s[a+b+c+1]^'A'&&s[a+b+c+1]^'B'&&b>=mx[c+1][2]) dp[a][b][c+1]+=dp[a][b][c];
	}
	return dp[n][n][n];
}
void Solve(){
	scanf("%d",&n);ans=0;
	for(int o:{0,1}){
		scanf("%s",t[o]);
		int La=-1;
		for(int j=0;j<=n;j++) if(t[o][j]=='1') p[o][j]=La,La=j;
	}
	scanf("%s",s+1);
	if(n^60){puts("-1");return;}
	for(int i=0;i<=n;i++) if(t[0][i]=='1') for(int j=0;j<=n;j++) if(t[1][j]=='1'){
		ans+=calc({i},{j});
		if(~p[0][i]) ans-=calc({p[0][i],i},{j});
		if(~p[1][j]) ans-=calc({i},{p[1][j],j});
		if(~p[0][i]&&~p[1][j]) ans+=calc({p[0][i],i},{p[1][j],j});
	}
	printf("%u\n",ans);
}
int main(){
	int t=1,op;
	scanf("%d%d",&t,&op);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}