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

#include  <ext/pb_ds/assoc_container.hpp>
#include  <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#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--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;

const int K = 26;
const int INF = 1e9 + 47;

bool isSub(const vector<vector<int>>& ent, const string& t)
{
	int j = -1;
	for (const char& ch: t)
	{
		int i = ch - 'a';
		auto it = lower_bound(all(ent[i]), j);
		if (it == ent[i].end())
			return false;
		
		j = *it + 1;
	}
	return true;
}

int solve()
{
	string u, s;
	if (!(cin >> u >> s))
		return 1;
	
	int m = sz(u), n = sz(s);
	vector<vector<int>> ent(K);
	FOR (i, 0, n)
	{
		ent[s[i] - 'a'].pb(i);
	}
	
	int len = INF;
	FOR (i, 0, m)
	{
		len = min(len, sz(ent[u[i] - 'a']) + 1);
	}
	//cerr << "len = " << len << '\n';
	
	int q;
	cin >> q;
	while (q--)
	{
		string ss;
		cin >> ss;
		int nn = sz(ss);
		if (nn != len)
		{
			cout << "0\n";
			continue;
		}
		cout << (isSub(ent, ss) ^ 1) << '\n';
	}
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1e9;
	//cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}