#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "ahocorasick"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		//freopen("test.out","w",stdout);
	}
}

#define MAX  1000001
#define INF 0xffffff

struct dict{
	struct dict * f[26];
	struct dict * fail;
	vector<int>cuv;
	int nr;
	dict(){ for(int i=0;i<26;i++)f[i] = NULL; fail = NULL; cuv.resize(0); nr = 0; } }*t,*c[MAX];

char a[MAX],b[10001];
int n,num[101],u;

void add(char *b,int idx)
{
	dict *g = t;
	int urm;
	while( isalpha(*b) )
	{
		urm = *b - 'a';
		if(g->f[urm] == NULL) g->f[urm] = new dict;
		g=g->f[urm];
		b++;
	}
	g->cuv.push_back(idx);
}

void bfs()
{
	dict *fr,*dir;
	int p;
	t->fail = t;
	c[p=u=1]=t;
	while(p<=u)
	{
		fr = c[p++];
		for(int i=0;i<26;i++)
			if(fr->f[i]!=0)
			{
				for(dir = fr->fail; dir != t && dir->f[i] == NULL; dir=dir->fail);
				if(dir->f[i]!=NULL && dir->f[i] != fr->f[i])dir=dir->f[i];
				fr->f[i]->fail = dir;
				c[++u] = fr->f[i];
			}
	}
	t->fail = NULL;
}

void ahocorasick(char *b)
{
	dict *g = t;
	int urm;
	while( isalpha(*b) )
	{
		urm = *b-'a';
		while(g!=t && g->f[urm] == NULL)g=g->fail;
		if(g->f[urm] != NULL)g=g->f[urm];
		b++;
		g->nr++;
	}
}

void antibfs()
{
	dict *fr;
	while(u>0)
	{
		fr=c[u--];
		if(fr->fail != NULL)fr->fail->nr += fr->nr;
		for(int i=0;i<fr->cuv.size();i++)num[fr->cuv[i]]=fr->nr;
	}
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);
	// start
	t = new dict;
		scanf("%s ",a);
		scanf("%d ",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%s ",b);
			add(b,i);
		}
		bfs();
		ahocorasick(a);
		antibfs();
		for(int i=1;i<=n;i++) printf("%d\n",num[i]);
	return 0;
}