// qdd on Jan 21, 2023

#ifdef qdd
#include <ringo>
#else
#include <bits/stdc++.h>
#define dbg(...)
#define dbgr(x, y)
#endif

using namespace std;

using ll = long long;

#define ALL(x) begin(x), end(x)

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (T& x : v) is >> x;
  return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  bool f = 0;
  for (const T& x : v) (f ? os << ' ' : os) << x, f = 1;
  return os;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  string v, s;
  cin >> v >> s;
  int MSK = 0;
  for (char c : v) {
    MSK |= (1 << (c - 'a'));
  }
  int n = s.size();
  int now = 0, len = 1;
  for (int i = 0; i < n; i++) {
    now |= (1 << (s[i] - 'a'));
    if (now == MSK) {
      now = 0;
      len++;
    }
  }
  vector<vector<int>> dp(n + 1, vector<int>(26, -1));
  for (int i = 1; i <= n; i++) {
    int k = s[i - 1] - 'a';
    for (int j = i - 1; j >= 0 && dp[j][k] == -1; j--) {
      dp[j][k] = i;
    }
  }
  int q;
  cin >> q;
  while (q--) {
    string t;
    cin >> t;
    int m = t.size();
    int i = 0, j = 0;
    while (j < m && i != -1) {
      i = dp[i][t[j] - 'a'];
      if (i != -1) j++;
    }
    cout << (j == m ? 0 : (m == len)) << '\n';
  }

  return 0;
}