#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 main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	string alp;
	string s;
	cin >> alp >> s;
	map<char, int> m;
	FOR (i, 0, SZ(alp))
		m[alp[i]] = i;
	int n = SZ(s);
	vector<VI> nxt(n + 1, VI(SZ(alp), n));
	RFOR (i, n, 0)
	{
		nxt[i] = nxt[i + 1];
		nxt[i][m[s[i]]] = i;
	}
	int mn = 0;
	int j = -1;
	while (j != n)
	{
		int r = -1;
		FOR (i, 0, SZ(alp))
			r = max(r, nxt[j + 1][i]);
		mn++;
		j = r;
	}
	int tt;
	cin >> tt;
	while (tt--)
	{
		string t;
		cin >> t;
		if (SZ(t) != mn)
		{
			cout << 0 << '\n';
			continue;
		}
		j = -1;
		FOR (i, 0, SZ(t))
		{
			assert(j != n);
			j = nxt[j + 1][m[t[i]]];
		}
		if (j == n)
			cout << 1 << '\n';
		else
			cout << 0 << '\n';
	}
	
	return 0;
}