#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=65;
int type,n,pre[N*3][3];
string s1,s2,a;
void solve() {
    cin>>n>>s1>>s2>>a,a=' '+a;
    for(int i=1;i<=3*n;i++)for(int j=0;j<3;j++)pre[i][j]=pre[i-1][j]+(a[i]==j+'A');
    int mx[3]{};
    for(int i=1;i<=3*n;i++)for(int j=0;j<3;j++)mx[j]=max(mx[j],pre[i][j]-pre[i][(j+2)%3]);
    while(mx[0]<=n&&s1[mx[0]]=='0')mx[0]++;
    while(mx[1]<=n&&s2[mx[1]]=='0')mx[1]++;
    cout<<(mx[0]+mx[1]+mx[2]<=n)<<'\n';
}
int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int tt;cin>>tt>>type;
    while(tt--)solve();
    return 0;
}