#include <fstream>
#include <vector>
#include <map>
#include <cstring>
 
using namespace std;
 
ifstream cin("ahocorasick.in");
ofstream cout("ahocorasick.out");
 
struct Trie {
    Trie *Next;
    map<char,Trie*> Son;
    int val;
    Trie() {
        Next = 0;
        val = 0;
    }
};
 
const int SMAX = 1000002, LMAX = 10002, NMAX = 102;
char A[SMAX], S[NMAX][LMAX];
int N;
Trie *T, *leaf[NMAX];
 
Trie *insert(Trie *t,char *str) {
    if(*str == 0) return t;
    if(t->Son.count(*str) == 0) { 
        t->Son[*str] = new Trie;
    }
    t = t->Son[*(str++)];
    return insert(t,str);
}
 
void readData() {
    cin.getline(A,SMAX);
    cin>>N;
    cin.get();
    for(int i = 0;i < N;i++) {
        cin.getline(S[i],LMAX);
    }
}
 
void buildTrie() {
    T = new Trie;
    for(int i = 0;i < N;i++) {
        leaf[i] = insert(T,S[i]);
    }
}
 
void ahoCorasick() {
    buildTrie();
    vector<Trie*> Q;
    Q.push_back(T);
    Trie *v, *w, *son;
    for (int left = 0; left < (int)Q.size();) {
        v = Q[left++];
        for(auto& s : v->Son) {
            const char& c = s.first;
            son = s.second;
            for(w = v->Next;w && w->Son.count(c) == 0;) w = w->Next;
            son->Next = w ? w->Son[c] : T;
            Q.push_back(son);
        } 
    }

    v = T;
    for(int i = 0;A[i] != 0;i++) {
        while(v && v->Son.count(A[i]) == 0) v = v->Next;
        if(!v) {
            v = T;
        } else {
            v = v->Son[A[i]];
            v->val++;
        }
    }

    for(int i = (int)Q.size() - 1;i >= 0;i--) {
        if(Q[i]->Next != 0)   {
            Q[i]->Next->val += Q[i]->val;
        }
    }

    for(int i = 0;i < N;i++) {
        cout << leaf[i]->val <<"\n";
    }
}
 
int main()
{
    readData();
    ahoCorasick();
    return 0;
}