#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 1e6 + 5, INF = 1e9;

int n, m;
string v;
int dp[N];
vector<int> indices[26];

int solve(int idx) {
    if (idx > n)
        return 0;

    int &ret = dp[idx];

    if (~ret)
        return ret;

    ret = INF;

    for (int i = 0; i < m; i++) {
        auto up = upper_bound(indices[v[i] - 'a'].begin(), indices[v[i] - 'a'].end(), idx);

        ret = min(ret, solve(*up) + 1);
    }

    return ret;
}

bool valid(int idx, int relIdx, string &s) {
    if (idx > n)
        return 0;

    if (relIdx >= s.size())
        return 1;

    auto up = upper_bound(indices[s[relIdx] - 'a'].begin(), indices[s[relIdx] - 'a'].end(), idx);

    return valid(*up, relIdx + 1, s);
}

void testCase() {
    string s;
    cin >> v >> s;

    n = s.size(), m = v.size();

    sort(v.begin(), v.end());

    for (int i = 0; i < n; i++)
        indices[s[i] - 'a'].push_back(i + 1);

    for (int i = 0; i < m; i++)
        indices[v[i] - 'a'].push_back(n + 1);

    memset(dp, -1, sizeof dp);

    int q;
    cin >> q;

    while (q--) {
        cin >> s;

        if (s.size() != solve(0) || valid(indices[s[0] - 'a'][0], 1, s))
            cout << 0 << el;
        else
            cout << 1 << el;
    }
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}