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

typedef vector<int> vi;
typedef pair<int, int> pii;

#define nl '\n'

const int DEBUG = false, ALPHA = 26;

vector<vi> nxt;
vi valid;
int shortestLength;

void init(string &str, string &alphabet)
{
    // set up alphabet
    valid = vi (ALPHA, false);

    for(int i = 0; i< alphabet.size(); i++)
        valid[alphabet[i] - 'a'] = true;

    if(DEBUG) { cout << "alphabet:"; for(int i = 0; i < ALPHA; i++) cout << valid[i]; cout << nl;}

    // set up next index
    nxt = vector<vi> (str.size() + 1, vi (26));
    vi alpha (ALPHA, str.size());

    for(int i = str.size() - 1; i >= 0; i--)
    {
        for(int j = 0; j < ALPHA;j ++)
        {
            nxt[i+1][j] = alpha[j];
        }

        alpha[str[i] - 'a'] = i;
    }

    nxt[0] = alpha;

    if(DEBUG)
    {
        cout << "NEXT: " << nl;
        for(int i = 0; i < nxt.size(); i++)
        {
            for(int j = 0; j < nxt[i].size();j ++)
                cout << nxt[i][j] << " ";
            cout << nl;
        }
        cout << endl;
    }
    
}

int getLength()
{
    int len = 0;
    deque<int> q;
    deque<int> q2;
    vi visited (nxt.size());
    visited[0] = true;

    q.push_back(0);

    while(true)
    {
        len ++;
        if(DEBUG) cout << "Current Shortest Len = " << len << nl;

        while(!q.empty())
        {
            int idx = q.front();
            q.pop_front();
            if(DEBUG) cout << "\tchecking idx " << idx << nl;

            for(int alpha = 0; alpha < ALPHA; alpha++)
            {
                if(!valid[alpha]) continue;

                int jump = nxt[idx][alpha] + 1;

                if(jump >= nxt.size())
                    return len;

                if(visited[jump]) continue;
                
                visited[jump] = true;
                q2.push_back(jump);
                if(DEBUG) cout << "\t\tadding idx " << jump << " to deque " << nl;
            }
        }

        q = q2;
        q2 = deque<int> (0);
    }
}

int query(string &q)
{
    if(q.size() != shortestLength) return false;

    int s = 0;
    for(int i = 0; i < q.size(); i++)
    {
        if(!valid[q[i] - 'a']) return false;    // invalid alphabet char

        s = nxt[s][q[i] - 'a'] + 1;

        if(s >= nxt.size()) return true;
    }

    return false;
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int q;
    string alphabet, str, queryStr;

    cin >> alphabet;
    cin >> str;

    init(str, alphabet);

    shortestLength = getLength();
    if(DEBUG) cout << "shortest length = " << shortestLength << nl;

    cin >> q;

    while(q--)
    {
        cin >> queryStr;
        cout << query(queryStr) << nl;
    }

    


    return 0;
}