#include<bits/stdc++.h>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;
typedef unsigned int ll;
typedef unsigned long long ull;
#define MP make_pair
#define pii pair<int,int>
const double PI=acos(-1.0);
template <class Miaowu>
inline void in(Miaowu &x){
    char c;x=0;bool f=0;
    for(c=getchar();c<'0'||c>'9';c=getchar())f|=c=='-';
    for(;c>='0'&&c<='9';c=getchar())x=(x<<1)+(x<<3)+(c^48);
    x=f?-x:x;
}
const int N=185;
char a[N],s1[N],s2[N];
int T,cas,n;
int main(){
    // freopen("qwq.in","r",stdin);
    // freopen("qwq.out","w",stdout);
    for(cin>>T>>cas;T;T--){
        scanf("%d%s%s%s",&n,s1,s2,a+1);
        int ha=0,hb=0,hc=0;int cnt=0;
        for(int i=1;i<=3*n;i++){
            if(a[i]=='A')if(!hc)cnt++;else hc--;
            if(a[i]=='B')if(!ha)cnt++;else ha--;
            if(a[i]=='C')if(!hb)cnt++;else hb--;
            if(a[i]=='A')ha++;
            if(a[i]=='B')hb++;
            if(a[i]=='C')hc++;
        }
        puts(cnt<=n?"1":"0");
    }
    return 0;
}