#include<bits/stdc++.h>
#define ll long long
#define ui unsigned int
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
const int Maxn=65,Maxm=Maxn*3;
inline void add(ui &x,ui y){x+=y;}
ui f[Maxn][Maxn][2][2],g[Maxn][Maxn][2][2];
int n;
char c[Maxm];
char fA[Maxn],fB[Maxn];
bool vis[Maxn][Maxn];
inline void work(){
    n=read();
    scanf("%s%s",fA,fB);
    scanf("%s",c+1);
    ui ans=0;
    int num=0;
    if(n<60){writeln(-1);return;}
    fr(lstA,0,n) fr(lstB,0,n){
        int x=-1,y=-1;
        fr(i,lstA,n) if(fA[i]=='1') {x=i;break;}
        fr(i,lstB,n) if(fB[i]=='1') {y=i;break;}
        if(x==-1 || y==-1 || x+y>n) continue;
        int z=n-x-y;x=lstA;y=lstB;
        // cout<<x<<' '<<y<<' '<<z<<endl;
        vector<pii> vc,vc1;
        f[0][0][x==0][y==0]=1;
        vc.pb(mk(0,0));
        fr(i,0,3*n-1){
            // cout<<i<<endl;
            // memcpy(g,f,sizeof(f));memset(f,0,sizeof(f));
            for(auto tmp:vc){
                int A,B,tp1,tp2;
                A=tmp.first;B=tmp.second;
                tp1=0;tp2=0;
                // cout<<i<<' '<<A<<' '<<B<<' '<<tp1<<' '<<tp2<<endl;
                g[A][B][tp1][tp2]=f[A][B][tp1][tp2];
                f[A][B][tp1][tp2]=0;
                tp1=0;tp2=1;
                // cout<<i<<' '<<A<<' '<<B<<' '<<tp1<<' '<<tp2<<endl;
                g[A][B][tp1][tp2]=f[A][B][tp1][tp2];
                f[A][B][tp1][tp2]=0;
                tp1=1;tp2=0;
                // cout<<i<<' '<<A<<' '<<B<<' '<<tp1<<' '<<tp2<<endl;
                g[A][B][tp1][tp2]=f[A][B][tp1][tp2];
                f[A][B][tp1][tp2]=0;
                tp1=1;tp2=1;
                // cout<<i<<' '<<A<<' '<<B<<' '<<tp1<<' '<<tp2<<endl;
                g[A][B][tp1][tp2]=f[A][B][tp1][tp2];
                f[A][B][tp1][tp2]=0;
            }
            for(auto tmp:vc){
                int A,B,tp1,tp2;
                A=tmp.first;B=tmp.second;
                vis[A][B]=0;
            }
            for(auto tmp:vc){
                int A,B,tp1,tp2;
                A=tmp.first;B=tmp.second;
                int C,v;
                tp1=tp2=0;
                C=i-A-B,v=g[A][B][tp1][tp2];
                // cout<<"*****"<<i<<' '<<f[2][2][1][1]<<endl;
                // cout<<i<<' '<<A<<' '<<B<<' '<<C<<' '<<tp1<<' '<<tp2<<' '<<v<<endl;
                if(c[i+1]=='A' || c[i+1]=='?'){
                    if(A+1-C<=x && A+1<=n){
                        // cout<<"**A"<<' '<<(A+1-C==x)<<' '<<tp1<<endl;
                        if(!vis[A+1][B]){
                            vis[A+1][B]=1;
                            vc1.pb(mk(A+1,B));
                        }
                        add(f[A+1][B][tp1|(A+1-C==x)][tp2],v);
                    }
                }
                if(c[i+1]=='B' || c[i+1]=='?'){
                    // cout<<"*"<<B+1-A<<' '<<y<<endl;
                    if(B+1-A<=y && B+1<=n){
                        // cout<<"**B"<<endl;
                        // cout<<"**"<<A<<' '<<B+1<<' '<<tp1<<' '<<(tp2|(B+1-A==y))<<' '<<v<<endl;
                        if(!vis[A][B+1]){
                            vis[A][B+1]=1;
                            vc1.pb(mk(A,B+1));
                        }
                        add(f[A][B+1][tp1][tp2|(B+1-A==y)],v);
                    }
                }
                if(c[i+1]=='C' || c[i+1]=='?'){
                    if(C+1-B<=z && C+1<=n){
                        // cout<<"**C"<<endl;
                        if(!vis[A][B]){
                            vis[A][B]=1;
                            vc1.pb(mk(A,B));
                        }
                        add(f[A][B][tp1][tp2],v);
                    }
                }
                tp1=tp2=1;
                if(g[A][B][tp1][tp2]){
                    C=i-A-B,v=g[A][B][tp1][tp2];
                    // cout<<"*****"<<i<<' '<<f[2][2][1][1]<<endl;
                    // cout<<i<<' '<<A<<' '<<B<<' '<<C<<' '<<tp1<<' '<<tp2<<' '<<v<<endl;
                    if(c[i+1]=='A' || c[i+1]=='?'){
                        if(A+1-C<=x && A+1<=n){
                            // cout<<"**A"<<' '<<(A+1-C==x)<<' '<<tp1<<endl;
                            add(f[A+1][B][tp1|(A+1-C==x)][tp2],v);
                        }
                    }
                    if(c[i+1]=='B' || c[i+1]=='?'){
                        // cout<<"*"<<B+1-A<<' '<<y<<endl;
                        if(B+1-A<=y && B+1<=n){
                            // cout<<"**B"<<endl;
                            // cout<<"**"<<A<<' '<<B+1<<' '<<tp1<<' '<<(tp2|(B+1-A==y))<<' '<<v<<endl;
                            add(f[A][B+1][tp1][tp2|(B+1-A==y)],v);
                        }
                    }
                    if(c[i+1]=='C' || c[i+1]=='?'){
                        if(C+1-B<=z && C+1<=n){
                            // cout<<"**C"<<endl;
                            add(f[A][B][tp1][tp2],v);
                        }
                    }
                }tp1=0;tp2=1;
                if(g[A][B][tp1][tp2]){
                    C=i-A-B,v=g[A][B][tp1][tp2];
                    // cout<<"*****"<<i<<' '<<f[2][2][1][1]<<endl;
                    // cout<<i<<' '<<A<<' '<<B<<' '<<C<<' '<<tp1<<' '<<tp2<<' '<<v<<endl;
                    if(c[i+1]=='A' || c[i+1]=='?'){
                        if(A+1-C<=x && A+1<=n){
                            // cout<<"**A"<<' '<<(A+1-C==x)<<' '<<tp1<<endl;
                            add(f[A+1][B][tp1|(A+1-C==x)][tp2],v);
                        }
                    }
                    if(c[i+1]=='B' || c[i+1]=='?'){
                        // cout<<"*"<<B+1-A<<' '<<y<<endl;
                        if(B+1-A<=y && B+1<=n){
                            // cout<<"**B"<<endl;
                            // cout<<"**"<<A<<' '<<B+1<<' '<<tp1<<' '<<(tp2|(B+1-A==y))<<' '<<v<<endl;
                            add(f[A][B+1][tp1][tp2|(B+1-A==y)],v);
                        }
                    }
                    if(c[i+1]=='C' || c[i+1]=='?'){
                        if(C+1-B<=z && C+1<=n){
                            // cout<<"**C"<<endl;
                            add(f[A][B][tp1][tp2],v);
                        }
                    }
                }tp1=1;tp2=0;
                if(g[A][B][tp1][tp2]){
                    C=i-A-B,v=g[A][B][tp1][tp2];
                    // cout<<"*****"<<i<<' '<<f[2][2][1][1]<<endl;
                    // cout<<i<<' '<<A<<' '<<B<<' '<<C<<' '<<tp1<<' '<<tp2<<' '<<v<<endl;
                    if(c[i+1]=='A' || c[i+1]=='?'){
                        if(A+1-C<=x && A+1<=n){
                            // cout<<"**A"<<' '<<(A+1-C==x)<<' '<<tp1<<endl;
                            add(f[A+1][B][tp1|(A+1-C==x)][tp2],v);
                        }
                    }
                    if(c[i+1]=='B' || c[i+1]=='?'){
                        // cout<<"*"<<B+1-A<<' '<<y<<endl;
                        if(B+1-A<=y && B+1<=n){
                            // cout<<"**B"<<endl;
                            // cout<<"**"<<A<<' '<<B+1<<' '<<tp1<<' '<<(tp2|(B+1-A==y))<<' '<<v<<endl;
                            add(f[A][B+1][tp1][tp2|(B+1-A==y)],v);
                        }
                    }
                    if(c[i+1]=='C' || c[i+1]=='?'){
                        if(C+1-B<=z && C+1<=n){
                            // cout<<"**C"<<endl;
                            add(f[A][B][tp1][tp2],v);
                        }
                    }
                }
            }
            swap(vc,vc1);vector<pii> ().swap(vc1);
        }
        for(auto tmp:vc){
            int A,B,tp1,tp2;
            A=tmp.first;B=tmp.second;
            vis[A][B]=0;
        }
        // cout<<f[n][n][1][1]<<endl;
        add(ans,f[n][n][1][1]);
        fr(tp1,0,1) fr(tp2,0,1) f[n][n][tp1][tp2]=0;
    }writeln(ans);
    // cerr<<num<<endl;
}
inline void init(){
	int t=read();int tp=read();
	while(t--){
        // cerr<<t<<endl;
        work();
    }
}
signed main(){
    // return system("fc a.out out.out");
	// freopen("a.in","r",stdin);
	// freopen("a.out","w",stdout);
    init();
    // cerr<<(double)clock()/CLOCKS_PER_SEC<<endl;
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}