#ifdef debug
#include <chrono>
#endif

#include <iostream>
#include <algorithm> // next_permutation
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstring> //memcpy
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric> //accumulate
//#include <map>
//#include <unordered_map> //hash func.
#include <fstream> //ifstream, ofstream

//#define NDEBUG //If NDEBUG is defined before #include <cassert>, assert will be ignored. You had better define NDEBUG when u submit the code.
#include <cassert> //assert

using namespace std;


#define dout cout
//If u wanna output to a text file instead of standard output, plz define OUTPUTFILE.
//#define OUTPUTFILE "output.txt" //*******************************************************************************************************************************************
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/output.txt"
#endif


#define din cin
//If u wanna input from a text file instead of standard input, plz define INPUTFROMTEXTFILE???.
//#define INPUTFILE "input.txt" //*******************************************************************************************************************************************
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif

#define scan(A) scanf("%d", &(A))
#define disp(A) dout << #A << " = " << setw(3) << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define dispAll(A,n) dout << #A << " = "; rep(j, 0, (n)) {disP(A[j]);} dout << endl
//#define dispAll(A,n) cout << #A << " = "; rep(j, 0, (n)) {cout << setw(3) << A[j] << " ";} cout << endl

#define sign(x) ((x)>0)-((x)<0) //x<0: -1, x=0: 0, x>0: +1
#define p(i) (i)/2
#define l(i) (i)*2
#define r(i) (i)*2+1

int dx[] = {1,-1, 0, 0, 1, 1,-1,-1}; //???????????????????????????????¨??????????????????????????????????
int dy[] = {0, 0,-1, 1,-1, 1, 1,-1};

typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long ull;

const int INF = (int)2e9+10;
const ll INF_LL = (ll)9e18-1LL; //Be careful for overflow.
const ull INF_ULL = (ull)1e19-1ULL;
const int NONE = -1;
const ll MOD = (ll)1e9+7; //??§???????´???°?????£??¨??¨????????°????????????10???7??????

const int N_MAX = 1000010; //num of vertex or element
const int M_MAX = 100000; //num of edge
const int DATA_MAX = 1000000010;

int N;

char T[N_MAX];

const int P_LEN_MAX = 1010;
char P[10010][P_LEN_MAX];

int hashTable_T[P_LEN_MAX][N_MAX]; //????????????lenP????????????T??????????????\???


int main() {
    
    //cin, cout????????????  ?????¨??????cin?????????????????¨??¨cin??§???scanf?????????????????¨??¨scanf??§??±?????????????????????
    cin.tie(0); //cin??¨cout??????????????????
    ios::sync_with_stdio(false); //iostream??¨stdio??????????????????
    
    //read input data
    int i = 0;
    while(1) {
        scanf("%c", &T[i]);
        if(T[i]=='\n') { T[i] = '\0'; break; }
        else i++;
    }
    
    int Q;
    scanf("%d ", &Q);
    rep(i,0,Q) {
        int j = 0;
        while(1) {
            scanf("%c", &P[i][j]);
            if(P[i][j]=='\n') { P[i][j] = '\0'; break; }
            else j++;
        }
    }
    
#ifdef debug
    disp(T);
    disp(strlen(T));
    rep(i,0,Q) { disp(P[i]); disp(strlen(P[i])); }
#endif
    
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //start timer
    auto startTime = chrono::system_clock::now();
#endif
    //------------------------------------------------------------------------------------------
    
    
    
    //find P[i] among T by Rabin-Karp Algorithm (using Rolling Hash)
    
    int lenT = strlen(T);
    const int B = 10007;
    
    //calc. hashTable_T[][]
    rep(lenP,1,P_LEN_MAX+1) {
        
        int BpowLenP = 1;
        rep(k,0,lenP) BpowLenP *= B;
        
        hashTable_T[lenP][0] = 0;
        rep(k,0,lenP) hashTable_T[lenP][0] = hashTable_T[lenP][0] * B + T[k];
        
        rep(j,1,lenT-lenP+1) {
            hashTable_T[lenP][j] = hashTable_T[lenP][j-1] * B - T[j-1] * BpowLenP + T[j-1+lenP];
        }
    }
    
    
    rep(i,0,Q) {
        int lenP = strlen(P[i]);
        
        int hashP = 0;
        rep(k,0,lenP) hashP = hashP * B + P[i][k];
        
        
        bool found = false;
        rep(j,0,lenT-lenP+1) {
            if(hashP == hashTable_T[lenP][j]) {
                found = true;
                break;
            }
        }
        
        printf("%d\n", found);
        
    }

    
    
    
    
    
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //stop timer
    auto endTime = chrono::system_clock::now();
    auto dur = endTime - startTime;
    auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
    dout << fixed << setprecision(4) << (double)msec/1000 << " sec \n";
#endif
    //------------------------------------------------------------------------------------------
    
#ifdef INPUTFILE
    inputfile.close();
#endif
    
#ifdef OUTPUTFILE
    outputfile.close();
    cout << "\"" << OutputFilePath << "\"" << endl;
#endif
    
    return 0;
}