#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
int cnt[MAXN * 2];
struct state {
  int len, link, first_pos;
  bool isClone;
  map<char, int> next;
};
state st[MAXN * 2];
int sz, last;
void sa_init() {
  for (int i = 0; i < sz; i++) st[i].next.clear();
  st[0].len = 0;
  st[0].link = -1;
  sz = last = 0;
  ++sz;
}
void sa_extend(char c) {
  int cur = sz++;
  st[cur].len = st[last].len + 1;
  st[cur].first_pos = st[cur].len - 1;
  st[cur].isClone = false;
  int p = last;
  while (p != -1 && !st[p].next.count(c)) {
    st[p].next[c] = cur;
    p = st[p].link;
  }
  if (p == -1) {
    st[cur].link = 0;
  } else {
    int q = st[p].next[c];
    if (st[p].len + 1 == st[q].len) {
      st[cur].link = q;
    } else {
      int clone = sz++;
      st[clone].len = st[p].len + 1;
      st[clone].next = st[q].next;
      st[clone].link = st[q].link;
      st[clone].first_pos = st[q].first_pos;
      st[clone].isClone = true;
      while (p != -1 && st[p].next[c] == q) {
        st[p].next[c] = clone;
        p = st[p].link;
      }
      st[q].link = st[cur].link = clone;
    }
  }
  last = cur;
}
bool cmp(int i, int j) { return st[i].len > st[j].len; }
int b[MAXN];
int pow_cad(string &P) {
  int i = 0, j = -1;
  b[0] = -1;
  while (i < (P).size()) {
    while (j >= 0 && P[i] != P[j]) j = b[j];
    i++, j++, b[i] = j;
  }
  int n = (P).size();
  int k = n - b[n];
  if (n % k == 0) return k;
  return n;
}
void match(string &t, int k) {
  int v = 0, l = 0, ans = 0;
  for (int i = 0; i < (t).size(); i++) {
    while (v && !st[v].next.count(t[i])) {
      v = st[v].link;
      l = st[v].len;
    }
    if (st[v].next.count(t[i])) {
      v = st[v].next[t[i]];
      l++;
      if (l >= k) {
        if (st[st[v].link].len >= k) {
          v = st[v].link;
          l = st[v].len;
        }
        ans += cnt[v];
      }
    }
  }
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string s;
  cin >> s;
  sa_init();
  for (auto c : s) {
    sa_extend(c);
  }
  for (int i = 1; i < sz; i++) {
    if (!st[i].isClone) cnt[i] = 1;
  }
  vector<int> node(sz);
  iota((node).begin(), (node).end(), 0);
  sort((node).begin(), (node).end(), cmp);
  for (int u : node) {
    if (~st[u].link) cnt[st[u].link] += cnt[u];
  }
  int n;
  string pat;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> pat;
    int k = (pat).size();
    int rep = pow_cad(pat);
    pat += pat.substr(0, rep - 1);
    cerr << "pat"
         << "_=_" << pat << "\n";
    match(pat, k);
  }
  return 0;
}
