#include <bits/stdc++.h>

using namespace std;

const int S = 'z' + 1 - 'a';
const int N = 100;

class Trie;

queue<Trie*> q;

vector<int> bulan[N];

class Trie {
public:
    Trie* v[S];
    Trie* fail;
    Trie* dict;
    int print;
    bool root;

    Trie(bool f) {
        print = -1;
        root = f;
        fail = NULL;
        dict = NULL;
        for (int i = 0; i < S; i++)
            v[i] = NULL;
        if (f) {
            fail = this;
        }
    }

    void add(int where, char s[], unsigned int p) {
        if (s[p] == NULL) {
            if (print >= 0) {
                bulan[print].push_back(where);
            }
            else {
                print = where;
            }
            return;
        }
        if (v[s[p] - 'a'] == NULL) {
            v[s[p] - 'a'] = new Trie(false);
        }
        v[s[p] - 'a']->add(where, s, p + 1);
    }
};

void bfs (Trie* trie) {
    q.push(trie);
    while (!q.empty()) {
        Trie* node = q.front();
        q.pop();
        for (int i = 0; i < S; i++) {
            Trie* son = node->v[i];
            if (son != NULL) {
                q.push(son);
                if (node->root) {
                    son->fail = node;
                    continue;
                }
                Trie* curr = node->fail;
                while (!curr->root && curr->v[i] == NULL) {
                    curr = curr->fail;
                }
                if(curr->v[i] != NULL) {
                    son->fail = curr->v[i];
                }
                else {
                    son->fail = curr;
                }
                if (son->fail->print >= 0) {
                    son->dict = son->fail;
                }
                else {
                    son->dict = son->fail->dict;
                }
            }
        }
    }
}

Trie* T = new Trie(true);
const int MAX = 1e6;
int ans[N + 1];
char text[MAX + 1];
int n;

void update_ans(Trie* trie) {
    while(trie != NULL) {
        ans[trie->print]++;
        trie = trie->dict;
    }
}

void solve() {
    Trie* curr = T;
    for (unsigned int i = 0; text[i]; i++) {
        int c = text[i]- 'a';
        while (!curr->root && curr->v[c] == NULL) {
            curr = curr->fail;
        }
        if (curr->v[c] != NULL) {
            curr = curr->v[c];
            update_ans(curr);
        }
    }
}

void init() {
    freopen("ahocorasick.in", "r", stdin);
    freopen("ahocorasick.out", "w", stdout);
}
const int L = 1e4;
char s[L + 1];

int main() {
    init();
    gets(text);
    scanf("%d\n",&n);
    for (int i = 0; i < n; i++) {
        gets(s);
        T->add(i, s, 0);
    }
    q.push(T);
    bfs(T);
    solve();
    for (int i = 0; i < n; i++) {
        for (int x : bulan[i]) {
            ans[x] = ans[i];
        }
    }
    for (int i = 0; i < n; i++) {
        cout << ans[i] << '\n';
    }
    return 0;
}