#include <bits/stdc++.h>
using namespace std;

const int N = 5e2 + 5;

char A[N], s[N], t[N];

int la, ls, lt;

bool check() {
    if(t[0] != t[1]) {
        bool ok = 1;
        for(int i = 1; i < lt - 1; ++ i) ok &= (t[i] == t[i + 1]);
        if(!ok) return 0;
        if(s[ls - 1] != t[0]) return 0;
        for(int i = 1; i < lt; ++ i) ok &= (t[i] == s[i - 1]);
        return ok;
    }
    bool ok = 1;
    for(int i = 0; i < lt - 2; ++ i) ok &= (t[i] == t[i + 1]);
    if(!ok) return 0;
    if(t[lt - 1] == t[lt - 2]) {
        return 0;
    }
    if(s[0] != t[lt - 1]) return 0;
    for(int i = 0; i < lt - 1; ++ i) {
        if(s[ls - i - 1] != t[0])return 0;
    }
    return 1;
}

void rmain() {
    scanf("%s%s%s", A, s, t);
    la = strlen(A), ls = strlen(s), lt = strlen(t);
    int cnt = 0;

    if(ls < lt) {
        swap(ls, lt);
        swap(s, t);
    }

    for(int i = 0; i < ls - lt + 1; ++ i) {
        bool ok = 1;
        for(int j = 0; j < lt; ++ j) {
            ok &= (s[i + j] == t[j]);
        }
        if(ok) ++ cnt;
    }
    if(cnt > 1) {
        puts("1");
        return;
    }
    if(cnt == 1) {
        puts("1");
        return;
    }
    if(la > 2) {
        puts("0");
        return;
    }
    if(ls == lt) {
       if(t[0] != t[1]) {
            swap(s, t);
            swap(ls, lt);
        }

        bool ok = 1;
        for(int i = 1; i < ls - 1; ++ i)
        ok &= (s[i] == s[i + 1]);

        for(int i = 0; i < lt - 2; ++ i) {
            ok &= (t[i] == t[i + 1]);
        }

        ok &= (t[lt - 1] != t[lt - 2]);

        ok &= (s[0] == t[lt - 1]);
        if(ok)
        puts("1"); 
        else puts("0");
        return;
    }
    
    if(check()) {
        puts("1");
    } else puts("0");

}

int main() {
    int T;
    for(cin >> T; T --;) {
        rmain();
    }
}