#include<bits/stdc++.h>

typedef long long ll;

using namespace std;
const int N = 1e6 + 10;
char v[30];
char s[N];

int len1, len;
int n;
int vis[30];
int to[30][N];
int last[30];

void solve() {
    cin >> (v + 1);
    cin >> (s + 1);
    len1 = strlen(v + 1), len = strlen(s + 1);
    for (int i = 1; i <= len1; i++) vis[v[i] - 'a' + 1] = 1;
    for (int i = 1; i <= 26; i++) last[i] = len + 1;
    for (int j = 1; j <= 26; j++) {
        to[j][len + 1] = len + 1;
    }

    for (int i = len; i >= 1; i--) {
        for (int j = 1; j <= 26; j++) {
            to[j][i] = last[j];
        }
        last[s[i] - 'a' + 1] = i;
    }
    for (int j = 1; j <= 26; j++) {
        to[j][0] = last[j];
    }
    int MinLen = 0;
    int P = 0;
    while (P <= len) {
        int tmp = P;
        for (int i = 1; i <= 26; i++)
            if (vis[i]) {
                tmp = max(tmp, to[i][P]);
            }
        MinLen++;
        P = tmp;
    }
    cin >> n;
    string S;
    for (int i = 1; i <= n; i++) {
        cin >> S;
        int p = 0;
        int cnt = 0;
        for (int j = 0; j < S.size(); j++) {
            p = to[S[j] - 'a' + 1][p];
            if (p == len + 1) cnt++;
        }
        if (cnt == 1 && S.size() == MinLen) cout << 1 << '\n';
        else cout << 0 << '\n';
    }
}


signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int _ = 1;
//    cin >> _;
    for (int o = 1; o <= _; o++) {
        solve();
    }
    return 0;
}
/*
abcd
abcccabac
3
cbb
cbba
cba
 */