#include <bits/stdc++.h>
using namespace std;
int n, m, last;
int nxt[2002002][26], link[2002002], dp[2002002], cnt[2002002], ord[2002002],
    occur[2002002];
char s[2002002], p[2002002];
void extend(int c) {
  int x = last, y = last = ++m;
  dp[y] = dp[x] + 1;
  occur[y] = 1;
  while (x && !nxt[x][c]) nxt[x][c] = y, x = link[x];
  if (!x)
    link[y] = 1;
  else {
    int z = nxt[x][c];
    if (dp[z] == dp[x] + 1)
      link[y] = z;
    else {
      int u = ++m;
      memcpy(nxt[u], nxt[z], sizeof nxt[u]);
      link[u] = link[z], link[z] = link[y] = u;
      dp[u] = dp[x] + 1;
      while (x && nxt[x][c] == z) nxt[x][c] = u, x = link[x];
    }
  }
}
void build(char *s) {
  n = strlen(s), m = 0;
  last = ++m;
  for (int i = 0; i < n; i++) extend(s[i] - 'a');
  for (int i = 1; i <= m; i++) cnt[dp[i]]++;
  for (int i = 1; i <= n; i++) cnt[i] += cnt[i - 1];
  for (int i = m; i >= 1; i--) ord[cnt[dp[i]]--] = i;
  for (int i = m; i >= 1; i--) occur[link[ord[i]]] += occur[ord[i]];
}
int q, T, vis[2002002];
int main() {
  scanf("%s", s);
  build(s);
  scanf("%d", &q);
  while (q--) {
    scanf("%s", p);
    T++;
    int len = strlen(p);
    int x = 1, cl = 0, ans = 0;
    for (int i = 0; i < len * 2 - 1; i++) {
      int c = p[i % len] - 'a';
      while (x && !nxt[x][c]) x = link[x];
      if (!x)
        x = 1;
      else {
        cl = min(cl, dp[x]) + 1;
        x = nxt[x][c];
        if (cl >= len) {
          while (x && dp[link[x]] >= len) x = link[x];
          if (vis[x] != T) ans += occur[x], vis[x] = T;
        }
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
