#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream f("ahocorasick.in");
ofstream g("ahocorasick.out");
struct ahocor
{
    int val;
    vector <int> cuv;
    ahocor *fiu[26],*fail;
    ahocor()
    {
        val=0;
        fail=0;
        memset(fiu,0,sizeof(fiu));
    }
}*p,*q[10005*10005];
ahocor *t=new ahocor;
void ahoc_insert(ahocor *t,char *c,int k)
{
    if(isalpha(*c)==0)
    {
        t->cuv.push_back(k);
        return;
    }
    int ch=*c-'a';
    if(t->fiu[ch]==0)
        t->fiu[ch]=new ahocor;
    ahoc_insert(t->fiu[ch],c+1,k);
}
int st=1,dr;
void make_fails(ahocor *t)
{
    t->fail=t;
    dr++;
    q[dr]=t;
    while(st<=dr)
    {
        ahocor *k=q[st];
        st++;
        for(int i=0;i<26;i++)
            if(k->fiu[i]!=0)
            {
                dr++;
                q[dr]=k->fiu[i];
                ahocor *v=k->fail;
                while(v->fiu[i]==0 && v!=t)
                    v=v->fail;
                if(v->fiu[i]!=0 && v->fiu[i]!=k->fiu[i])
                    v=v->fiu[i];
                k->fiu[i]->fail=v;
            }
    }
    t->fail=0;
}
int sol[10011];
void anti_bfs()
{
    for(int i=dr;i>0;i--)
    {
        ahocor *k=q[i];
        if(k->fail!=0)
            k->fail->val=k->fail->val+k->val;
        for(int j=0;j<k->cuv.size();j++)
            sol[k->cuv[j]]=k->val;
    }
}
char C[1000011],c[10011];
int n,i,m,l;
int main()
{
    f>>C;
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>c;
        ahoc_insert(t,c,i);
    }
    make_fails(t);
    p=t;
    m=strlen(C);
    for(i=0;i<m;i++)
    {
        l=C[i]-'a';
        while(p!=t && p->fiu[l]==0)
            p=p->fail;
        if(p->fiu[l]!=0)
            p=p->fiu[l];
        p->val++;
    }
    anti_bfs();
    for(i=1;i<=n;i++)
        g<<sol[i]<<'\n';
    return 0;
}