// File generated on 24/11/15 22:03 by Anand

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

#define fastio ios::sync_with_stdio(false); cin.tie(0)
#define rep(i, m, n)  for (long long i = m; i < n; i++)
#define DEBUG(x) cout << "debug: " << x << "\n"
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define pb push_back
#define sz size

typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vec;
typedef vector<vec> vecc;
typedef vector<pll> vecp;


void SOLVE() {
   set<char> a;
   string u;
   cin >> u;
   string s;
   cin >> s;
   vector<vector<ll>> q(s.size() + 1, vector<ll>(26, -1));
   for(ll i = s.size() - 1; i >= 0; --i) {
        for(int j = 0; j < 26; j++) {
            if (s[i] == 'a' + j) {q[i][j] = i + 1;}
            else q[i][j] = q[i+1][j];
        }
   }

   ll ans = 0;
   for(char& i : s) {
        a.insert(i);
        if (a.size() == u.size()) {ans++; a.clear();}
   }
   ans++;
   ll n;
   cin >> n;
   while(n--) {
        string g;
        cin >> g;
        if (g.size() != ans) {cout << "0\n"; continue;}
        ll cur = 0;
        for(char& i : g) {
            cur = q[cur][i - 'a'];
            if (cur == -1) break;
        }
        if (cur == -1) cout << "1\n";
        else cout << "0\n";
   }
}

signed main() {
    fastio;


		SOLVE();

    return 0;
}