/// :3
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;

#include "bits/stdc++.h"

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
//#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 1e6+5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;
const int dx[] = {1,1,0,-1,-1,-1,0,1};
const int dy[] = {0,1,1,1,0,-1,-1,-1};

const int bl = 1000;
string v, s;
int nxt[N][26], n;
int dp[N];
bool isSub(string t) {
    for(int i = 0, j = 0; i < t.size(); i++) {
        j = nxt[j][t[i]-'a'];
        if(j == n + 1)return false;
    }
    return true;
}
void doWork() {

    cin >> v >> s;
    n = s.size();
    fill(nxt[n], nxt[n] + 26, n+1);
    for(int i = n - 1; i >= 0; --i) {
        f(j,0,26)nxt[i][j]=nxt[i+1][j];
        nxt[i][s[i]-'a'] = i + 1;
    }

    dp[n] = 1;
    for(int i = n - 1; i >= 0; --i) {
        dp[i] = INT_MAX;
        for(char c : v) {
            dp[i] = min(dp[i], dp[nxt[i][c-'a']] + 1);
        }
    }

    int q;  cin >> q;
    while(q--) {
        string t;
        cin >> t;
        if(!isSub(t) && t.size() == dp[0])
            cout << "1\n";
        else
            cout << "0\n";
    }



}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}