#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
string Sigma;
int go[1011][26];
int tp[1011][26];
int fail[1011];
int fa[1011];
int fac[2011];
int lv[1011];
vector<int> v[1011];
int tot;
int label[1011];

int add(char s[], int coef) {
	int l = strlen(s);
	int x = 1;
	for (int i=0; i<l; i++) {
		int c = s[i]-'a';
		if (!go[x][c]) {
			go[x][c] = ++tot;
			fa[go[x][c]] = x;
			lv[go[x][c]] = lv[x]+1;
			fac[go[x][c]] = c;
		}
		x = go[x][c];
	}
	label[x] += coef;
	return x;
}

void build() {
	for (int i=0; i<=tot; i++) v[i].clear();
	for (int i=1; i<=tot; i++) {
		v[lv[i]].PB(i);
	}
	// cerr<<"ok"<<endl;
	fail[1] = 1;
	for (int i=0; i<=tot; i++) {
		for (auto x : v[i]) {
			if (x==1 || fa[x] == 1) fail[x] = 1;
			else {
				int &f = fail[x];
				f = fail[fa[x]];
				while (f != 1 && !go[f][fac[x]]) f = fail[f];
				if (go[f][fac[x]]) f = go[f][fac[x]];
			}
		}
	}
	memset(tp, 0, sizeof(tp));
	// cerr<<"ok"<<endl;
	for (int i=0; i<=tot; i++) {
		for (auto x : v[i]) {
			for (int j=0; j<26; j++) {
				int &t = tp[x][j];
				if (go[x][j]) t = go[x][j];
				else { 
					t = x;
					while (t!=1 && !go[t][j]) t = fail[t];
					if (go[t][j]) t = go[t][j];
				}
			}
		}
	}
}
const int qmax = 1011;
int que[qmax], qb, qe;
bool inq[1011];
int dis[1011];
int cntp[1011];
int occ[1011];
bool check() {
	memset(inq, 0, sizeof(inq));
	memset(dis, 20, sizeof(dis));
	memset(cntp, 0, sizeof(cntp));
	memset(occ, 0, sizeof(occ));
	for (int i=0; i<=tot; i++) {
		for (auto x : v[i]) {
			occ[x] = label[x] + occ[fail[x]];
		}
	}

	qb = qe = 0;
	que[qe++] = 1;
	inq[1] = 1;
	dis[1] = 0;
	while (qb != qe) {
		int x = que[qb];
		// cerr<<"x="<<x<<" dis="<<dis[x]<<endl;
		qb++; if (qb>=qmax) qb = 0;
		inq[x] = 0;
		for (auto c : Sigma) {
			int u = tp[x][c-'a'];
			// cerr<<"u="<<u<<endl;
			if (dis[u] > dis[x] + occ[u]) {
				cntp[u] = cntp[x] + 1;
				if (cntp[u] >= tot) return false;
				dis[u] = dis[x] + occ[u];
				if (!inq[u]) {
					inq[u] = true;
					que[qe++] = u;
					if (qe>=qmax) qe = 0;
				}
			}
		}
	}
	return true;
}
void solve() {
	tot = 1;
	memset(go, 0, sizeof(go));
	memset(label, 0, sizeof(label));
	cin>>Sigma;
	int state[2];
	for (int i=0; i<2; i++) {
		char s[1011];
		scanf("%s", s);
		state[i] = add(s, i?1:-1);
	}
	// if (state[0] == state[1]) {
	// 	puts("1");
	// 	return;
	// }
	// if (is_substr(state[0], state[1]) || is_substr(state[1], state[0])) {

	// }

	build();
	int ans = check();
	for (int i=1; i<=tot; i++) label[i] = -label[i];
	ans |= check();
	printf("%d\n", ans);
}
int main() {
	int Tn;
	scanf("%d", &Tn);
	while (Tn--) {
		solve();
	}
	return 0;
}