#include <fstream>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#define pb push_back
using namespace std;
char s[1000100], t[10100]; 
int N, r1[10100],r[10100];
int Q[10100],st,dr;
vector<int> sol,g[1000100];
 
struct Trie {
    int ind;
    Trie *q[26], *f;
    Trie(int x) {
        ind = x;
        for(int i=0;i<26;++i) q[i] = 0;
    }
};
Trie *T = new Trie(0);
vector<Trie*> v; 
 
void ins(Trie *nod, char *s) {
    if(*s=='\n') {
        sol.pb(nod->ind); return;
    }
    int c = *s - 'a';
    if(nod->q[c]==0) {
        Trie *nt = new Trie(v.size());
        v.pb(nt); nod->q[c] = nt;
    }
    ins(nod->q[c],s+1);
}
 
void make_fail() {
    for(int i=0;i<26;++i) {
        if(v[0]->q[i] == 0) continue;
        Trie *y = v[0]->q[i];
        Q[dr++] = y->ind;
        y->f = v[0];
        g[0].pb(y->ind);
    }
    while(st < dr) {
        int x = Q[st++];
        for(int i=0;i<26;++i) {
            if(v[x]->q[i] == 0) continue; 
            Trie *y = v[x]->q[i];
            Trie *curr = v[x]->f;
            while(curr != 0 && curr->q[i] == 0) curr = curr->f;
            if(curr == 0) y->f = v[0];
            else y->f = curr->q[i];
            g[y->f->ind].pb(y->ind);
            Q[dr++] = y->ind;
        }
    }
}
 
void dfs(int x) {
    r[x] = r1[x];
    for(auto y: g[x]) {
        dfs(y); r[x] += r[y];
    }
}
 
void count_occurences() {
    int L = strlen(s);
    Trie *curr = v[0];
    for(int i=0;i<L;++i) {
        int c = s[i]-'a';
        while(curr != 0 && curr->q[c] == 0) {
            curr = curr->f;
        }
        if(curr == 0) curr = v[0];
        else {
            ++r1[curr->q[c]->ind];
            curr = curr->q[c];
        }
    }
    dfs(0);
}
 
int main() {
    freopen("ahocorasick.in","r",stdin);
    freopen("ahocorasick.out","w",stdout);
    scanf("%s%d",s,&N);
    v.pb(T);
    for(int i=1;i<=N;++i) {
        scanf("%s",t);
        t[strlen(t)] = '\n';
        ins(T,t);
    }
    make_fail(); 
    count_occurences();  
    for(auto x: sol) {
        printf("%d\n",r[x]);
    }
    return 0;
}