#include <bits/stdc++.h>
#define Nmax 1000005

using namespace std;

char a[Nmax],s[Nmax];
int n,l;

struct Trie
{
    Trie *leg[26],*suf;
    vector <Trie*> rev;
    int cnt;
    bool solved;
    Trie()
    {
        for(int i=0;i<26;++i) leg[i]=0;
        suf=0;
        cnt=solved=0;
        rev.resize(0);
    }
} *rad = new Trie() , *wh[Nmax];
queue <Trie*> Q;

inline void add(Trie *nod, int p, int ind)
{
    if(p==l+1)
    {
        wh[ind]=nod;
        return;
    }
    if(!nod->leg[s[p]-'a']) nod->leg[s[p]-'a'] = new Trie();
    add(nod->leg[s[p]-'a'],p+1,ind);
}

inline void Make_Suf()
{
    int i;
    Trie *nod,*node;

    for(i=0;i<26;++i)
        if(rad->leg[i])
        {
            rad->leg[i]->suf=rad;
            Q.push(rad->leg[i]);
        }

    while(!Q.empty())
    {
        nod = Q.front(); Q.pop();
        for(i=0;i<26;++i)
            if(nod->leg[i])
            {
                for(node=nod->suf;node!=rad && !node->leg[i];node=node->suf);
                if(node->leg[i]) node=node->leg[i];
                nod->leg[i]->suf=node;
                node->rev.push_back(nod->leg[i]);
                Q.push(nod->leg[i]);
            }
    }

}

inline void Solve(Trie *nod)
{
    nod->solved=1;
    for(auto it : nod->rev)
    {
        if(!it->solved) Solve(it);
        nod->cnt+=it->cnt;
    }
}

inline void Dfs(Trie *nod)
{
    if(!nod->solved) Solve(nod);

    for(int i=0;i<26;++i)
        if(nod->leg[i]) Dfs(nod->leg[i]);
}

int main()
{
    int i,m;
    ifstream cin("ahocorasick.in");
    ofstream cout("ahocorasick.out");
    cin>>(a+1); n=strlen(a+1);
    cin>>m;
    for(i=1;i<=m;++i)
    {
        cin>>(s+1); l=strlen(s+1);
        add(rad,1,i);
    }
    Make_Suf();
    Trie *nod = rad;
    for(i=1;i<=n;++i)
    {
        for(;nod!=rad && !nod->leg[a[i]-'a'];nod=nod->suf);
        if(nod->leg[a[i]-'a']) nod=nod->leg[a[i]-'a'];
        nod->cnt++;
    }
    Dfs(rad);
    for(i=1;i<=m;++i) cout<<wh[i]->cnt<<"\n";
    return 0;
}