#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back
#define mt make_tuple

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()
#define uniq(x) unique(all(x)), x.end()

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T, size_t N>
void re(array <T, N>& x);
template <class T> 
void re(vt <T>& x);

template <class T> 
void re(T& x) {
    cin >> x;
}

template <class T, class... M> 
void re(T& x, M&... args) {
    re(x); re(args...);
}

template <class T> 
void re(vt <T>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void re(array <T, N>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void wr(array <T, N> x);
template <class T> 
void wr(vt <T> x);

template <class T> 
void wr(T x) {
    cout << x;
}

template <class T, class ...M>  void wr(T x, M... args) {
    wr(x), wr(args...);
}

template <class T> 
void wr(vt <T> x) {
    for(auto it : x)
        wr(it, ' ');
}

template <class T, size_t N>
void wr(array <T, N> x) {
    for(auto it : x)
        wr(it, ' ');
}

template<class T, class... M>
auto mvt(size_t n, M&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector<T>(n, args...);
    else
        return vector(n, mvt<T>(args...));
}

void set_fixed(int p = 0) {
    cout << fixed << setprecision(p);
}

void set_scientific() {
    cout << scientific;
}

inline void Open(const string Name) {
    #ifndef ONLINE_JUDGE
        (void)!freopen((Name + ".in").c_str(), "r", stdin);
        (void)!freopen((Name + ".out").c_str(), "w", stdout);
    #endif
}

struct AhoCorasick {
    struct node {
        int idx, dp;
        node *nxt[26];
        node *failLink, *outputLink;

        node() : idx(-1), dp(0), failLink(nullptr), outputLink(nullptr) {
            for (int i = 0; i < 26; ++i)
                nxt[i] = nullptr;                
        };
    };

    vt <node*> order;
    node* ptr[101];
    node* root;

    AhoCorasick() {
        root = new node();
    }

    void ins(const int& idx, const string& s) {
        node* curr = root;
        for (int i = 0; i < len(s); ++i) {
            if (curr-> nxt[s[i] - 'a'] == nullptr) {
                curr-> nxt[s[i] - 'a'] = new node();
            }
            curr = curr-> nxt[s[i] - 'a'];
        }
        curr-> idx = idx;
        ptr[idx] = curr;
    }

    void build() {
        root->failLink = root-> outputLink = root;
        queue <node*> q;
        for (int i = 0; i < 26; ++i)
            if (root-> nxt[i]) {
                node *v = root -> nxt[i];
                v-> failLink = v-> outputLink = root;
                q.em(v);
            }

        order.emb(root);
        while (len(q)) {
            node* u = q.front();
            q.pop();

            order.emb(u);
            for (int i = 0; i < 26; ++i)
                if (u-> nxt[i]) {
                    node* v = u -> nxt[i];
                    node *tmp = u -> failLink;

                    while (!tmp-> nxt[i] and tmp != root) {
                        tmp = tmp-> failLink;
                    }

                    v-> failLink = (tmp-> nxt[i]? tmp-> nxt[i] : root);
                    v-> outputLink = (v-> failLink-> idx != -1? v-> failLink : v-> failLink-> outputLink);
                    q.em(v);
                }
        }
    }

    void makeCount(const string& s) {
        node* u = root;
        for (int i = 0; i < len(s); ++i) {
            while (!u-> nxt[s[i] - 'a'] and u != root) {
                u = u-> failLink;
            }

            if (u-> nxt[s[i] - 'a']) {
                u = u-> nxt[s[i] - 'a'];
            }

            u-> dp += 1;
        }

        reverse(all(order));
        for (auto& it : order) {
            it-> outputLink-> dp += it-> dp;
        }
    }


};

void solve() {
    AhoCorasick G;
    string T; re(T);
    int n; re(n);
    vt <string> v(n); re(v);

    for (int i = 0; i < n; ++i) {
        G.ins(i, v[i]);
    }
    G.build();
    G.makeCount(T);
    for (int i = 0; i < n; ++i)
        wr(G.ptr[i]-> dp, '\n');

}

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

    Open("ahocorasick");

    int t = 1;
    for(;t;t--) {
        solve();
    }
    
    return 0;
}