#include <bits/stdc++.h>
using namespace std;
 
struct nod
{
  int cnt;
  vector<int> id;
  nod* back;
  nod* son['z'-'a'+1]={0};
};
 
char c[1005000];
char v[10500];
int countt[150];
nod * root;
int n,t;
nod * q[10500*150];
 
int main()
{	
  freopen("ahocorasick.in","r",stdin);
	freopen("ahocorasick.out","w",stdout);
	scanf("%s",c);
	scanf("%d",&n);
  root= new nod;
  root->back= root;
  for(int i=0;i<n;i++)
  {
    scanf("%s",v);	
    nod * nd = root;
    for(int j=0;v[j]!='\0';j++)
    {
      int ch= v[j]-'a';
      if(nd->son[ch]==0)
        nd->son[ch]=new nod;
      if(nd==root)
        nd->son[ch]->back=root;
      nd= nd->son[ch];
      if(v[j+1]=='\0')
        nd->id.push_back(i);
    }
  }
  q[0]=root;
  for(int i=0;i<=t;++i)
  {
    nod * tp= q[i];
    for(int i=0;i<='z'-'a';i++)
    {
      nod * u = tp->son[i];
      if(u!=0)
      {
        nod *nd= tp->back;
        while( nd!=root &&nd->son[i]==0)
          nd= nd->back;
        if(nd->son[i]!=0 && nd->son[i]!=u)
          nd=nd->son[i];
        u->back= nd;
        t++;
        q[t]=u;
      }
    }
  }
  root->back=0;
  nod *nd= root;
  for(int i=0;c[i]!='\0';i++)
  {
    int ch = c[i]-'a';
    while(nd->son[ch]==0 && nd!=root) nd= nd->back;
    if(nd->son[ch]!=0)
    {
      nd=nd->son[ch];
      (nd->cnt)++;
    }
  }
  
  for(int i=t;i>0;i--)
  {
    nod * u =q[i];
    for(int it= 0;it!=u->id.size();++it )
      countt[u->id[it]]+=u->cnt;
    u->back->cnt+=u->cnt;
  }
  for(int i=0;i<n;i++)
    printf("%d\n",countt[i]);
}