#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int n, m;
char s[N];
int mask[27];
int store[27][27][10005];
int16_t idx[1 << 26];
int msk[10005], came[27];
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  s[0] = s[n + 1] = 'z' + 1;
  n += 2;
  int q;
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    char qs[27];
    scanf("%s", qs);
    msk[i] = 0;
    for (int j = 0; qs[j]; j++) msk[i] |= (1 << (qs[j] - 'a'));
    idx[msk[i]] = i;
  }
  for (int i = n - 1; i >= 0; i--) {
    int c1 = s[i] - 'a';
    for (int c2 = 0; c2 < 27; c2++) {
      if (idx[mask[c2]]) store[c1][c2][idx[mask[c2]]]++;
    }
    mask[c1] = 0;
    if (c1 != 26) {
      for (int c2 = 0; c2 < 27; c2++) {
        if (c2 != c1) {
          if (came[c2]) mask[c2] |= (1 << c1);
        }
      }
    }
    came[c1] = 1;
  }
  for (int i = 1; i <= q; i++) {
    int ans = 0;
    for (int c1 = 0; c1 < 27; c1++) {
      for (int c2 = 0; c2 < 27; c2++) {
        if ((msk[i] >> c1) & 1) continue;
        if ((msk[i] >> c2) & 1) continue;
        ans += store[c1][c2][idx[msk[i]]];
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
