#include <iostream>
#include <cstdio>
#include <vector>
#define MAXA 1000050
#define MAXN 110
#define MAXCUV 10050

using namespace std;

char s[MAXA], a[MAXCUV];
int n, sol[MAXN];

struct TrieNode
{
    int cnt;
    TrieNode* son[30];
    TrieNode* suf;
    vector<int> who;
    TrieNode()
    {
        cnt = 0;
        for (int i = 0; i < 30; i++)
            son[i] = nullptr;
    }
};
TrieNode* root = new TrieNode();
vector<TrieNode*> ord;

void add(char *p, int ind, TrieNode *crt = root)
{
    if (!*p) {
        crt->who.push_back(ind);
        return;
    }
    if (crt->son[*p-'a'] == nullptr)
        crt->son[*p-'a'] = new TrieNode();
    add(p+1, ind, crt->son[*p-'a']);
}

void build()
{
    ord.push_back(root);
    root->suf = root;
    TrieNode* nxt;
    for (int i = 0; i < ord.size(); i++) {
        TrieNode* crt = ord[i];
        for (int j = 0; j <= 'z'-'a'; j++) {
            if (crt->son[j] == nullptr) continue;
            ord.push_back(crt->son[j]);
            for (nxt = crt->suf; nxt != root && nxt->son[j] == nullptr; nxt = nxt->suf);
            if (nxt->son[j] && nxt->son[j] != crt->son[j]) nxt = nxt->son[j];
            crt->son[j]->suf = nxt;
        }
    }
}

void solve()
{
    TrieNode* crt = root;
    for (int i = 0; s[i]; i++)
    {
        for (; crt->son[s[i]-'a'] == nullptr && crt != root; crt = crt->suf);
        if (crt->son[s[i]-'a'])
            crt = crt->son[s[i]-'a'];
        crt->cnt++;
    }
}

void antibfs()
{
    for (int i = ord.size()-1; i >= 0; i--) {
        for (int y : ord[i]->who) sol[y] += ord[i]->cnt;
        ord[i]->suf->cnt += ord[i]->cnt;
    }
}

int main()
{
    freopen("ahocorasick.in", "r", stdin);
    freopen("ahocorasick.out", "w", stdout);

    gets(s);
    scanf("%d\n", &n);
    for (int i = 1; i <= n; i++) {
        gets(a);
        add(a, i);
    }
    build();
    solve();
    antibfs();
    for (int i = 1; i <= n; i++)
        printf("%d\n", sol[i]);


    return 0;
}