#include <bits/stdc++.h>

using i64 = long long;

std::vector<int> kmp(std::string s) {
    int n = s.size();
    std::vector<int> f(n + 1);
    for (int i = 1, j = 0; i < n; i++) {
        while (j && s[i] != s[j]) {
            j = f[j];
        }
        j += (s[i] == s[j]);
        f[i + 1] = j;
    }
    return f;
}

void solve() {
    std::string A, S, T;
    std::cin >> A >> S >> T;
    
    int n = S.size(), m = T.size();
    
    auto fs = kmp(S), ft = kmp(T);
    
    std::vector<std::array<int, 26>> gs(n), gt(m);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 26; j++) {
            int x = i;
            while (x && S[x] != 'a' + j) {
                x = fs[x];
            }
            x += (S[x] == 'a' + j);
            gs[i][j] = x;
        }
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < 26; j++) {
            int x = i;
            while (x && T[x] != 'a' + j) {
                x = ft[x];
            }
            x += (T[x] == 'a' + j);
            gt[i][j] = x;
        }
    }
    
    std::vector<std::vector<std::pair<int, int>>> adj(n * m);
    for (int u = 0; u < n * m; u++) {
        int x = u / m, y = u % m;
        for (auto c : A) {
            int i = c - 'a';
            int nx = gs[x][i];
            int ny = gt[y][i];
            int w = 0;
            if (nx == n) {
                nx = fs[n];
                w += 1;
            }
            if (ny == m) {
                ny = ft[m];
                w -= 1;
            }
            int v = nx * m + ny;
            adj[u].emplace_back(v, w);
        }
    }
    
    auto check = [&](int c) {
        std::queue<int> q;
        std::vector<int> f(n * m, 1E9);
        std::vector<int> inq(n * m);
        q.push(0);
        f[0] = 0;
        inq[0] = 1;
        int t = 0;
        while (!q.empty()) {
            int x = q.front();
            q.pop();
            inq[x] = 0;
            t += 1;
            if (t > (n + m) * (n + m)) {
                return true;
            }
            for (auto [y, w] : adj[x]) {
                w *= c;
                if (f[y] > f[x] + w) {
                    f[y] = f[x] + w;
                    if (!inq[y]) {
                        q.push(y);
                        inq[y] = 1;
                    }
                }
            }
        }
        return false;
    };
    
    if (check(1) && check(-1)) {
        std::cout << 0 << "\n";
    } else {
        std::cout << 1 << "\n";
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int K;
    std::cin >> K;
    
    while (K--) {
        solve();
    }
    
    return 0;
}