#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int sub(string sub, string s)
{
	int ans = 0;
	FOR(i, 0, SZ(s) - SZ(sub) + 1)
	{
		if(s.substr(i, SZ(sub)) == sub)
			ans++;
	}
	return ans;
}


bool check(string s, string t)
{
	RFOR(cnt, min(SZ(s), SZ(t)), 0)
	{
		string a = s.substr(SZ(s) - cnt, cnt);
		string b = t.substr(0, cnt);
		if(a != b)
			continue;
		
		string S = s;
		if(cnt != SZ(t))
			S += t.substr(cnt, SZ(t) - cnt);
		
		return sub(s, S) != sub(t, S);
	}
	assert(0);
}

int solve()
{
	string a, s, t;
	cin >> a >> s >> t;
	
	if(s == t)
		return 1;
	
	if(SZ(a) == 2)
	{
		if(SZ(s) != SZ(t))
			return 0;
		
		bool ok = 1;
		FOR(i, 0, SZ(s))
		{
			if(i % 2 == 0)
			{
				ok &= s[i] == s[0];
				ok &= t[i] == t[0];
			}
			else
			{
				ok &= s[i] != s[0];
				ok &= t[i] != t[0];
			}
		}
		return ok;
	}
	bool alp = 0;
	FOR(i, 0, SZ(a))
	{
		bool ok = 0;
		FOR(j, 0, SZ(s))
			ok |= s[j] == a[i];
		if(!ok)
			alp = 1;
		ok = 0;
		FOR(j, 0, SZ(t))
			ok |= t[j] == a[i];
		if(!ok)
			alp = 1;
		
	}
	
	if(check(s, t) || check(t, s) || alp)
		return 0;
	return 1;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while(t--)
		cout << solve() << "\n";
	
	return 0;
}