/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif


int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    string al;
    cin >> al;
    string s;
    cin >> s;
    vector<vector<ll>> ar(26);
    vector<ll> ye(26,0);
    FOR(i,0,26)
        if(al.find('a'+i) != string::npos)
            ye[i] = 1;
    ll n = sz(s);
    FOR(i,0,n)
    {
        ar[s[i]-'a'].pb(i);
    }
    ll res = 0;
    ll cur = -1;
    bool t = false;
    while(true)
    {
        res++;
        ll cur1 = 0;
        vector<ll> next(26,-1);
        FOR(i,0,26)
        {
            if(ye[i] == 0)
                continue;
            if(lower_bound(ar[i].begin(),ar[i].end(),cur+1)!= ar[i].end())
                cur1 = max(cur1,ar[i][lower_bound(ar[i].begin(),ar[i].end(),cur+1)-ar[i].begin()]);
            else
                t = true;
        }
        cur = cur1;
        if(t)
            break;
    }
    ll q = 0;
    cin >> q;
    FOR(i,0,q)
    {
        string s1;
        cin >> s1;
        if(sz(s1)!= res){
            cout << 0 << endl;
            continue;
        }
        t = true;
        cur = -1;
        FOR(j,0,sz(s1))
        {
            ll l = s1[j]-'a';
            if(lower_bound(ar[l].begin(),ar[l].end(),cur+1) != ar[l].end())
                cur = ar[l][lower_bound(ar[l].begin(),ar[l].end(),cur+1)-ar[l].begin()];
            else{
                t = false;
                break;
            }
        }
        if(!t)
            cout << '1' << endl;
        else
            cout << '0' << endl;
    }

}