#include<bits/stdc++.h>
#define FILE "read"
#define MAXN 2000010
using namespace std;
int n,m,cnt(1),last(1),mx[MAXN],par[MAXN],c[MAXN],vis[MAXN],id[MAXN],Right[MAXN],tr[MAXN][27];
char ch[MAXN];
void extend(int x){
	int np=++cnt,p=last; Right[np]=1;
	mx[np]=mx[p]+1;  last=np;
	while(p&&!tr[p][x])  tr[p][x]=np,p=par[p];
	if(!p)  par[np]=1;
	else{
		int q=tr[p][x];
		if(mx[q]==mx[p]+1)  par[np]=q;
		else{
			int nq=++cnt; mx[nq]=mx[p]+1;
			memcpy(tr[nq],tr[q],sizeof(tr[q]));
			par[nq]=par[q];  par[q]=par[np]=nq;
			while(p&&tr[p][x]==q)  tr[p][x]=nq,p=par[p];
		}
	}
}
void topsort(){
	for(int i=1;i<=cnt;++i)  c[mx[i]]++;
	for(int i=1;i<=n;++i)    c[i]+=c[i-1];
	for(int i=1;i<=cnt;++i)  id[c[mx[i]]--]=i;
	for(int i=cnt;i;--i)  Right[par[id[i]]]+=Right[id[i]];
}
void solve(int k){
	int now=1,len=0,ans=0;
	for(int i=1;i<=n*2;++i){
		while(now&&!tr[now][ch[i]-'a'])  now=par[now],len=mx[now];
		if(!now)  len=0,now=1;
		else now=tr[now][ch[i]-'a'],len++;
		while(now&&mx[par[now]]>=n)  now=par[now],len=mx[now];
		if(vis[now]!=k&&len>=n)  ans+=Right[now],vis[now]=k;
	}
	printf("%d\n",ans);
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	scanf("%s",ch+1);  n=strlen(ch+1);
	for(int i=1;i<=n;++i)  extend(ch[i]-'a');
	topsort();
	scanf("%d",&m);
	for(int i=1;i<=m;++i){
		scanf("%s",ch+1);  n=strlen(ch+1);  
		for(int j=1;j<=n;++j)  ch[n+j]=ch[j];
		solve(i);
	}
	return 0;
}