#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
char s[maxn];
int cnt[2 * maxn];
struct state {
  int link;
  int next[26];
  long long len;
};
state st[2 * maxn];
int sz;
int last;
void init() {
  sz = 1;
  last = 0;
  st[0].link = -1;
  st[0].len = 0;
}
set<pair<int, int> > base;
void sa_extend(char c) {
  int cur = sz++;
  st[cur].len = st[last].len + 1;
  int p = last;
  cnt[cur] = 1;
  base.insert(make_pair(st[cur].len, cur));
  while (p != -1 && !st[p].next[c - 'a']) {
    st[p].next[c - 'a'] = cur;
    p = st[p].link;
  }
  if (p == -1) {
    st[cur].link = 0;
  } else {
    int q = st[p].next[c - 'a'];
    if (st[p].len + 1 == st[q].len) {
      st[cur].link = q;
    } else {
      int clone = sz++;
      st[clone] = st[q];
      st[clone].len = st[p].len + 1;
      while (p != -1 && st[p].next[c - 'a'] == q) {
        st[p].next[c - 'a'] = clone;
        p = st[p].link;
      }
      st[cur].link = st[q].link = clone;
      cnt[clone] = 0;
      base.insert(make_pair(st[clone].len, clone));
    }
  }
  last = cur;
}
char t[1000005];
int main() {
  scanf("%s", s);
  init();
  for (int i = 0; s[i]; i++) {
    sa_extend(s[i]);
  }
  set<pair<int, int> >::reverse_iterator it;
  for (it = base.rbegin(); it != base.rend(); it++)
    cnt[st[it->second].link] += cnt[it->second];
  int q;
  scanf("%d", &q);
  while (q--) {
    scanf("%s", t);
    string ss = t;
    ss += t;
    int m = strlen(t);
    ss.pop_back();
    int v = 0, l = 0;
    int ans = 0;
    set<int> s;
    for (int i = 0; i < ss.size(); i++) {
      while (v && !st[v].next[ss[i] - 'a']) {
        v = st[v].link;
        l = st[v].len;
      }
      if (st[v].next[ss[i] - 'a']) {
        v = st[v].next[ss[i] - 'a'];
        ++l;
      }
      while (st[st[v].link].len >= m) {
        v = st[v].link;
        l = st[v].len;
      }
      if (l >= m) {
        s.insert(v);
      }
    }
    for (auto &it : s) ans += cnt[it];
    printf("%d\n", ans);
  }
  return 0;
}
