#include <iostream>
#include <array>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <assert.h>
#include <iomanip>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <fstream>
#include <random>

#define LEN(x) (long long)(x.size())
#define FOR(i, a, n) for(int i=(a);i<(n); ++i)
#define FOE(i, a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head&& head, Tail&&... tail) { std::cerr << head; if (sizeof...(tail) != 0) {std::cerr << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void debug(std::vector<T> &v) {for (auto& a : v) { std::cerr << a; if (&a != &v.back()) {std::cerr << " ";} }std::cerr << std::endl;}
template <class T> void debug(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
bool is_bit_on(const unsigned long long bit, const unsigned int i) { return (bit >> i) & 1u; }
unsigned long long bit_set(const unsigned long long bit, const unsigned int i, const unsigned int b) {
    assert(b == 0 or b == 1);
    if (b == 0) { return bit & ~(1ull << i); }
    else        {return bit | (1ull << i); }
}

// 初項s交差d長さnの数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

// xが2の階乗かどうか判定
bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int) v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;  // 1,073,741,824
const long long LINF = 1ull << 60u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1}, dx8 = {1, 0, -1, 0, 1, 1, -1, -1};

template<class T> class SparseTable {
    const int n;
    std::vector<std::vector<long long>> table1, table2;
    std::vector<long long> lookup1, lookup2;

public:
    SparseTable(int n) : n(n) {};

    void build(const std::vector<T> &line) {
        this->build(line, this->table1, this->lookup1, 1);
        this->build(line, this->table2, this->lookup2, -1);
    }

    // v[l, r)の最小値
    long long range_minimum_query(const int l, const int r) const {
        const int b = this->lookup1[r - l];
        return std::min(this->table1[b][l], this->table1[b][r - (1u << (unsigned int)b)]);
    }

    // v[l, r)の最大値
    long long range_maximum_query(const int l, const int r) const {
        const int b = this->lookup2[r - l];
        return -std::min(this->table2[b][l], this->table2[b][r - (1u << (unsigned int)b)]);
    }


private:
    void build(const std::vector<T> &line, std::vector<std::vector<long long>> &table, std::vector<long long> &lookup, int fix) {
        int b = 0;
        while((int)(1u << (unsigned int)b) <= this->n) {
            ++b;
        }
        table.resize(b, std::vector<long long>(1u << (unsigned int)b));
        for (int i = 0; i < this->n; i++) {
            table[0][i] = line[i] * fix;
        }

        for (int i = 1; i < b; i++) {
            for (int j = 0; j + (1u << (unsigned int)i) <= (1u << (unsigned int)b); j++) {
                table[i][j] = std::min(table[i - 1][j], table[i - 1][j + (1u << (unsigned int)(i - 1))]);
            }
        }

        lookup.resize(this->n + 1);
        for(int i = 2; i < (int)lookup.size(); i++) {
            lookup[i] = lookup[(unsigned int)i >> 1u] + 1;
        }
    }
};

class SuffixArray {
private:
    int n;
    int k;
    std::vector<int> rank;
    SparseTable<int> sparse_table;

public:
    const std::string s;
    std::vector<int> sa;
    std::vector<int> lcp;

public:
    SuffixArray(const std::string &s) : n(s.size()), sparse_table((int)s.size() + 1), s(s) {
        this->sa.resize(n + 1, 0);
        this->lcp.resize(n + 1, 0);
        this->rank.resize(n + 1, 0);
    }

    // O(n log^2 n)
    void build_suffix_array() {
        this->construct_sa();
        this->construct_lcp();
    }

    void build_sparse_table() {
        this->sparse_table.build(this->sa);
    }
    
    // sがpatternを含んでいるか
    // O(|pattern| log |S|)
    bool contain(const std::string &pattern) const {
        return this->contain(pattern, 0, this->n);
    }

    // s[left, right)がpatternを含んでいるか
    // O(|pattern| log |S|)
    bool contain(const std::string &pattern, int left, int right) const {
        assert(left >= 0);
        assert(right <= this->n);
        assert(left < right);

        const int pattern_size = pattern.length();
        while (right - left > 1) {
            int c = (left + right) / 2;
            // Sのsa[c]文字目から|pattern|文字をpatternを比較
            if (this->s.compare(this->sa[c], pattern_size, pattern) < 0) {
                left = c;
            }
            else {
                right = c;
            }
        }

        return this->s.compare(this->sa[right], pattern_size, pattern) == 0;
    }

    // s上にpatternが何回出現するか(重なりを許す)
    bool count(const std::string &pattern) const {
        // return find_last(pattern) - find_first(pattern);
        return false;
    }

    // s上で最初にpatternが出現する位置(0-index)
    int find_first(const std::string &pattern) const {
        const auto l = this->lower_bound_sa(pattern);
        const auto u = this->upper_bound_sa(pattern);
        if (l == -1 or u == -1) {
            return -1;
        }
        return this->sparse_table.range_minimum_query(l, u + 1);
    }

    // s上で最後にpatternが出現する位置(0-index)
    int find_last(const std::string &pattern) const {
        const auto l = this->lower_bound_sa(pattern);
        const auto u = this->upper_bound_sa(pattern);
        if (l == -1 or u == -1) {
            return -1;
        }
        return this->sparse_table.range_maximum_query(l, u + 1);
    }

    // sa上で最初にpatternが現れる位置
    int lower_bound_sa(const std::string &pattern) const {
        const int pattern_size = pattern.size();

        int left = -1, right = n;
        while (right - left > 1) {
            int c = (left + right) / 2;
            int ret = this->s.compare(this->sa[c], pattern_size, pattern);
            // patternが大きい
            if (ret >= 0) {
                right = c;
            }
            else {
                left = c;
            }
        }
        if (this->s.compare(this->sa[right], pattern_size, pattern) == 0) {
            return right;
        }
        return -1;
    }

    // sa上で最後にpatternが現れる位置
    int upper_bound_sa(const std::string &pattern) const {
        const int pattern_size = pattern.size();

        int left = -1, right = this->n + 1;
        while (right - left > 1) {
            int c = (left + right) / 2;
            int ret = this->s.compare(this->sa[c], pattern_size, pattern);
            // patternが小さい
            if (ret <= 0) {
                left = c;
            }
            else {
                right = c;
            }
        }

        if (this->s.compare(this->sa[left], pattern_size, pattern) == 0) {
            return left;
        }
        return -1;
    }

    void debug() {
        std::cout << "idx lcp sa sa[i]" << std::endl;
        for (int i = 0; i <= n; ++i) {
            std::cout << i << " " << lcp[i] << " " << sa[i] << " " << s.substr(sa[i]) << std::endl;
        }
    }

private:
    struct compare {
        compare(const SuffixArray &sa) : sa(sa) {}
        const SuffixArray &sa;

        // (rank[i], rank[i + k])と(rank[j], rank[j + k])を比較
        bool operator()(const int &i, const int &j) const {
            if (sa.rank[i] != sa.rank[j]) {
                return sa.rank[i] < sa.rank[j];
            }
            else {
                const int ri = i + sa.k <= sa.n ? sa.rank[i + sa.k] : -1;
                const int rj = j + sa.k <= sa.n ? sa.rank[j + sa.k] : -1;
                return ri < rj;
            }
        }
    };

    void construct_sa() {
        std::vector<int> tmp(this->n + 1, 0);

        for (int i = 0; i <= this->n; i++) {
            this->sa[i] = i;
            this->rank[i] = i < this->n ? this->s[i] : -1;
        }
        // k文字についてソートされているところから、2k文字でソートする
        for (this->k = 1; this->k <= this->n; this->k *= 2) {
            std::sort(this->sa.begin(), this->sa.end(), compare(*this));
            // いったんtmpに次のランクを計算し、それからrankに移す
            tmp[this->sa[0]] = 0;
            for (int i = 1; i <= this->n; i++) {
                tmp[this->sa[i]] = tmp[this->sa[i - 1]] + (compare(*this).operator()(this->sa[i - 1], this->sa[i]) ? 1 : 0);
            }
            for (int i = 0; i <= this->n; i++) {
                this->rank[i] = tmp[i];
            }
        }
    }

    void construct_lcp() {
        for (int i = 0; i <= this->n; i++) {
            this->rank[this->sa[i]] = i;
        }
        int h = 0;
        this->lcp[0] = 0;
        for (int i = 0; i < this->n; i++) {
            // 文字列中での位置iの接尾辞と、接尾辞配列中でその1つ前の接尾辞のLCPを求める
            int j = this->sa[this->rank[i] - 1];
            // hを先頭の分1減らし、後ろが一致しているだけ増やす
            if (h > 0) {
                h--;
            }
            for (; j + h < this->n and i + h < this->n; h++) {
                if (this->s[j + h] != this->s[i + h]) {
                    break;
                }
            }
            this->lcp[this->rank[i] - 1] = h;
        }
    }
};

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    string T;
    cin >> T;

    SuffixArray sa(T);
    sa.build_suffix_array();

    int Q;
    cin >> Q;
    for (int i = 0; i < Q; ++i) {
        string P;
        cin >> P;

        if (sa.contain(P)) {
            cout << 1 << endl;
        }
        else {
            cout << 0 << endl;
        }
    }

    return 0;
}


Measured memory_bytes: 19644