#include <bits/stdc++.h>
#define maxText 1000005
#define maxLen 100005
#define maxN 105
#define sigma 26
using namespace std;
struct trie
{
    trie *fiu[sigma];
    trie *fail;
    vector<int>_list;
    int cnt;
    trie()
    {
        for(int i=0;i<sigma;i++)
            fiu[i]=NULL;
        fail=NULL;
        cnt=0;
    }
}*root=new trie();

int n,i,fq[maxN];
char text[maxText],word[maxLen];

queue<trie*>Que;
vector<trie*>node_list;
void _insert(trie *nod,char *s,int idx)
{
    if(!*s){
        nod->_list.push_back(idx);
        return;
    }

    if(nod->fiu[*s-'a']==NULL)
        nod->fiu[*s-'a']=new trie();
    _insert(nod->fiu[*s-'a'],s+1,idx);
}

void solve(trie *root, char *str)
{
    trie *nod=root;
    while(*str)
    {
        while(nod!=root && nod->fiu[*str-'a']==NULL)
            nod=nod->fail;

        if(nod->fiu[*str-'a']!=NULL)
            nod=nod->fiu[*str-'a'];

        nod->cnt++;
        str++;
    }

    Que.push(root);
    while(!Que.empty()) /* anti-bfs */
    {
        trie *nod=Que.front();
        Que.pop();

        node_list.push_back(nod);
        for(int i=0;i<sigma;i++)
            if(nod->fiu[i])
                Que.push(nod->fiu[i]);
    }
    reverse(node_list.begin(),node_list.end());

    for(auto it:node_list)
    {
        for(auto idx:it->_list)
            fq[idx]+=it->cnt;
        if(it->fail!=NULL)
            it->fail->cnt+=it->cnt;
    }
}
int main()
{
    freopen("ahocorasick.in","r",stdin);
    freopen("ahocorasick.out","w",stdout);
    scanf("%s",text);
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%s",word);
        _insert(root,word,i);
    }

    root->fail=root;
    for(int i=0;i<sigma;i++)
        if(root->fiu[i]){
            root->fiu[i]->fail=root;
            Que.push(root->fiu[i]);
        }

    while(!Que.empty())
    {
        trie *nod=Que.front();
        Que.pop();
        for(int i=0;i<sigma;i++)
        {
            if(nod->fiu[i])
            {
                trie *failnod=nod->fail;
                while(failnod!=root && failnod->fiu[i]==NULL)
                    failnod=failnod->fail;

                if(failnod->fiu[i]!=NULL && failnod->fiu[i]!=nod->fiu[i])
                    failnod=failnod->fiu[i];
                nod->fiu[i]->fail=failnod;

                Que.push(nod->fiu[i]);
            }
        }
    }

    solve(root,text);

    for(i=1;i<=n;i++)
        printf("%d\n",fq[i]);
    return 0;
}