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

using namespace std;

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

struct Trie
{
    Trie *leg[26],*suflink;
    vector <Trie * > L;
    int cnt;
    Trie()
    {
        for(int i=0;i<26;++i) leg[i]=0;
        suflink=0; cnt=0; L.clear();
    }
} *rad = new Trie , *wh[Nmax];
queue <Trie*> Q;

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

inline void Make_Suflink()
{
    rad->suflink=rad; Q.push(rad);
    int i;
    while(!Q.empty())
    {
        Trie *nod = Q.front(); Q.pop();
        for(i=0;i<26;++i)
        {
            if(nod->leg[i]==0) continue;
            if(nod!=rad)
            {
                Trie *node = nod->suflink;
                while(node!=rad && node->leg[i]==0) node=node->suflink;
                if(node->leg[i]!=0) node=node->leg[i];
                nod->leg[i]->suflink=node; Q.push(nod->leg[i]);
                node->L.pb(nod->leg[i]);
            }
            else
            {
                nod->leg[i]->suflink=rad;
                rad->L.pb(nod->leg[i]);
                Q.push(nod->leg[i]);
            }
        }
    }
}

inline void Dfs(Trie *nod)
{
    for(auto it : nod->L)
    {
        if(it==0) continue;
        Dfs(it); nod->cnt+=it->cnt;
    }
}

int main()
{
    int m,i;
    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); len=strlen(s+1);
        Add(rad,1,i);
    }
    Make_Suflink();
    Trie *nod=rad;
    for(i=1;i<=n;++i)
    {
        while(nod!=rad && nod->leg[a[i]-'a']==0) nod=nod->suflink;
        if(nod->leg[a[i]-'a']!=0) nod=nod->leg[a[i]-'a'];
        nod->cnt++;
    }
    Dfs(rad);
    for(i=1;i<=m;++i) cout<<wh[i]->cnt<<"\n";
    return 0;
}