We'll call string s[a, b] = sasa + 1... sb (1 ≤ a ≤ b ≤ |s|) a substring of string s = s1s2... s|s|, where |s| is the length of string s.

The trace of a non-empty string t is a set of characters that the string consists of. For example, the trace of string "aab" equals {'a', 'b'}.

Let's consider an arbitrary string s and the set of its substrings with trace equal to C. We will denote the number of substrings from this set that are maximal by inclusion by r(C, s). Substring s[a, b] of length n = b - a + 1 belonging to some set is called maximal by inclusion, if there is no substring s[x, y] in this set with length greater than n, such that 1 ≤ x ≤ a ≤ b ≤ y ≤ |s|. Two substrings of string s are considered different even if they are equal but they are located at different positions of s.

Polycarpus got a challenging practical task on a stringology exam. He must do the following: given string s and non-empty sets of characters C1, C2, ..., Cm, find r(Ci, s) for each set Ci. Help Polycarpus to solve the problem as he really doesn't want to be expelled from the university and go to the army!

Input

The first line contains a non-empty string s (1 ≤ |s| ≤ 106).

The second line contains a single integer m (1 ≤ m ≤ 104). Next m lines contain descriptions of sets Ci. The i-th line contains string ci such that its trace equals Ci. It is guaranteed that all characters of each string ci are different.

Note that Ci are not necessarily different. All given strings consist of lowercase English letters.

Output

Print m integers — the i-th integer must equal r(Ci, s).

Examples

Input

aaaaa
2
a
a


Output

1
1


Input

abacaba
3
ac
ba
a


Output

1
2
4
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
const int maxn = 1000010;
int nxt[maxn][26] = {};
int len[maxn] = {};
pair<int, int> tt[10010];
int vv[10010];
int ans[10010];
int m;
int find(int val) {
  int l = -1;
  int r = m;
  while (r - l > 1) {
    int mid = (l + r) >> 1;
    if (tt[mid].first <= val)
      l = mid;
    else
      r = mid;
  }
  if (l == -1 || tt[l].first != val) return -1;
  return l;
}
int main() {
  string s;
  cin >> s;
  int n = s.length();
  for (int i = n - 1; i >= 0; --i) {
    if (i < n - 1 && s[i + 1] != s[i]) nxt[i][len[i]++] = i + 1;
    for (int j = 0; j < len[i + 1]; ++j)
      if (s[nxt[i + 1][j]] != s[i]) nxt[i][len[i]++] = nxt[i + 1][j];
  }
  scanf("%d", &m);
  for (int i = 0; i < m; ++i) {
    string t;
    cin >> t;
    int msk = 0;
    for (int j = 0; j < int((t).size()); ++j) msk |= 1 << (t[j] - 'a');
    tt[i] = make_pair(msk, i);
    vv[i] = msk;
  }
  sort(tt, tt + m);
  for (int i = 0; i < n; ++i) {
    if (i && s[i - 1] == s[i]) continue;
    int msk = 1 << (s[i] - 'a');
    int pos = find(msk);
    if (pos != -1) ans[tt[pos].second]++;
    for (int j = 0; j < len[i]; ++j) {
      if (i > 0 && s[nxt[i][j]] == s[i - 1]) break;
      msk |= 1 << (s[nxt[i][j]] - 'a');
      pos = find(msk);
      if (pos != -1) ans[tt[pos].second]++;
    }
  }
  for (int i = 0; i < m; ++i) {
    int pos = find(vv[i]);
    printf("%d\n", ans[tt[pos].second]);
  }
  return 0;
}
